./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_data.sol_14_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:25:18,341 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:25:18,377 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8d89f4-7276-490b-bf49-f4b4c3bbf604/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:25:18,380 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:25:18,380 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:25:18,393 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:25:18,393 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:25:18,393 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:25:18,394 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:25:18,394 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:25:18,394 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:25:18,394 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:25:18,394 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:25:18,394 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:25:18,394 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:25:18,394 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:18,395 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:25:18,395 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:25:18,396 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:25:18,396 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:25:18,580 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:25:18,586 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:25:18,588 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:25:18,588 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:25:18,589 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:25:18,589 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8d89f4-7276-490b-bf49-f4b4c3bbf604/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_data.sol_14_no_adts_000.smt2
[2025-05-07 17:25:18,590 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:25:18,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:25:18,889 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e8d89f4-7276-490b-bf49-f4b4c3bbf604/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_data.sol_14_no_adts_000.smt2
[2025-05-07 17:25:18,891 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:25:18,892 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:25:18,893 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:25:18,893 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:25:18,893 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:25:18,895 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,946 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18 Unit
[2025-05-07 17:25:18,946 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:25:18,947 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:25:18,947 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:25:18,947 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:25:18,957 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,957 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,983 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,983 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,991 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,992 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,993 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,996 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:18,998 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:19,011 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:25:19,011 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:25:19,012 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:25:19,012 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:25:19,012 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (1/1) ...
[2025-05-07 17:25:19,014 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:19,022 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:19,030 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:25:19,033 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:25:19,043 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:25:19,043 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:25:19,043 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:25:19,043 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_30_0 given in one single declaration
[2025-05-07 17:25:19,043 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_30_0
[2025-05-07 17:25:19,043 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_30_0
[2025-05-07 17:25:19,043 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,043 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,044 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,044 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_f_55_97_0 given in one single declaration
[2025-05-07 17:25:19,044 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_f_55_97_0
[2025-05-07 17:25:19,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_f_55_97_0
[2025-05-07 17:25:19,044 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,044 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_function_f__56_97_0
[2025-05-07 17:25:19,044 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,045 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,045 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,045 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,045 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,045 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_function_f__56_97_0
[2025-05-07 17:25:19,045 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_return_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,046 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_return_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_return_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,046 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,046 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,046 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,046 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_function_f__56_97_0
[2025-05-07 17:25:19,046 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_f__56_97_0 given in one single declaration
[2025-05-07 17:25:19,047 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_f__56_97_0
[2025-05-07 17:25:19,047 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_f__56_97_0
[2025-05-07 17:25:19,047 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_97_0 given in one single declaration
[2025-05-07 17:25:19,047 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_97_0
[2025-05-07 17:25:19,047 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_97_0
[2025-05-07 17:25:19,047 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_97_0 given in one single declaration
[2025-05-07 17:25:19,047 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_97_0
[2025-05-07 17:25:19,047 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_97_0
[2025-05-07 17:25:19,047 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_36_C_97_0 given in one single declaration
[2025-05-07 17:25:19,047 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_36_C_97_0
[2025-05-07 17:25:19,047 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_36_C_97_0
[2025-05-07 17:25:19,047 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_33_C_97_0 given in one single declaration
[2025-05-07 17:25:19,047 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_33_C_97_0
[2025-05-07 17:25:19,047 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_33_C_97_0
[2025-05-07 17:25:19,048 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_35_C_97_0 given in one single declaration
[2025-05-07 17:25:19,048 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_35_C_97_0
[2025-05-07 17:25:19,048 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_35_C_97_0
[2025-05-07 17:25:19,048 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_34_C_97_0 given in one single declaration
[2025-05-07 17:25:19,048 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_34_C_97_0
[2025-05-07 17:25:19,048 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_34_C_97_0
[2025-05-07 17:25:19,048 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_6_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,048 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_6_function_g__96_97_0
[2025-05-07 17:25:19,048 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_6_function_g__96_97_0
[2025-05-07 17:25:19,048 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,048 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_function_g__96_97_0
[2025-05-07 17:25:19,048 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_function_g__96_97_0
[2025-05-07 17:25:19,048 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,048 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_g__96_97_0
[2025-05-07 17:25:19,048 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_g__96_97_0
[2025-05-07 17:25:19,048 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,048 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_g_95_97_0 given in one single declaration
[2025-05-07 17:25:19,049 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_g_95_97_0
[2025-05-07 17:25:19,049 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_g_95_97_0
[2025-05-07 17:25:19,049 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,049 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,049 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,049 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,049 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_function_g__96_97_0
[2025-05-07 17:25:19,049 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,049 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_28_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,050 INFO  L130     BoogieDeclarations]: Found specification of procedure block_28_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_28_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,050 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,050 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_return_function_g__96_97_0 given in one single declaration
[2025-05-07 17:25:19,050 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_return_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_return_function_g__96_97_0
[2025-05-07 17:25:19,050 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:25:19,050 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:25:19,050 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:25:19,246 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:25:19,248 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:25:19,578 INFO  L?                        ?]: Removed 608 outVars from TransFormulas that were not future-live.
[2025-05-07 17:25:19,578 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:25:19,590 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:25:19,590 INFO  L312             CfgBuilder]: Removed 27 assume(true) statements.
[2025-05-07 17:25:19,590 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:19 BoogieIcfgContainer
[2025-05-07 17:25:19,590 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:25:19,592 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:25:19,592 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:25:19,595 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:25:19,595 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:18" (1/3) ...
[2025-05-07 17:25:19,596 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123a4cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:25:19, skipping insertion in model container
[2025-05-07 17:25:19,596 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:18" (2/3) ...
[2025-05-07 17:25:19,596 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123a4cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:25:19, skipping insertion in model container
[2025-05-07 17:25:19,596 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:19" (3/3) ...
[2025-05-07 17:25:19,598 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:25:19,608 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:25:19,610 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 39 procedures, 152 locations, 256 edges, 39 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:25:19,647 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:25:19,659 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3848cc33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:25:19,659 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:25:19,663 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 152 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 73 states have internal predecessors, (73), 43 states have call successors, (61), 38 states have call predecessors, (61), 38 states have return successors, (61), 40 states have call predecessors, (61), 43 states have call successors, (61)
[2025-05-07 17:25:19,674 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:19,674 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:19,675 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:19,675 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:19,679 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:19,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -1822488047, now seen corresponding path program 1 times
[2025-05-07 17:25:19,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:19,685 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759132529]
[2025-05-07 17:25:19,685 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:19,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:19,742 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:19,802 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:19,802 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:19,802 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:20,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:20,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:20,182 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759132529]
[2025-05-07 17:25:20,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759132529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:20,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:20,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:20,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870050545]
[2025-05-07 17:25:20,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:20,197 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:20,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:20,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:20,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,219 INFO  L87              Difference]: Start difference. First operand  has 152 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 73 states have internal predecessors, (73), 43 states have call successors, (61), 38 states have call predecessors, (61), 38 states have return successors, (61), 40 states have call predecessors, (61), 43 states have call successors, (61) Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:20,286 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:20,287 INFO  L93              Difference]: Finished difference Result 152 states and 194 transitions.
[2025-05-07 17:25:20,288 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:20,289 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:20,289 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:20,297 INFO  L225             Difference]: With dead ends: 152
[2025-05-07 17:25:20,297 INFO  L226             Difference]: Without dead ends: 146
[2025-05-07 17:25:20,298 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,300 INFO  L437           NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:20,301 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 752 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:20,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2025-05-07 17:25:20,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146.
[2025-05-07 17:25:20,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 146 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 69 states have internal predecessors, (69), 42 states have call successors, (59), 37 states have call predecessors, (59), 37 states have return successors, (59), 39 states have call predecessors, (59), 42 states have call successors, (59)
[2025-05-07 17:25:20,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions.
[2025-05-07 17:25:20,332 INFO  L79                 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 51
[2025-05-07 17:25:20,333 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:20,333 INFO  L485      AbstractCegarLoop]: Abstraction has 146 states and 187 transitions.
[2025-05-07 17:25:20,333 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:20,333 INFO  L278                IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions.
[2025-05-07 17:25:20,335 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:20,335 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:20,335 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:20,335 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:25:20,336 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:20,336 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:20,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -232035011, now seen corresponding path program 1 times
[2025-05-07 17:25:20,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:20,336 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611730873]
[2025-05-07 17:25:20,336 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:20,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:20,361 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:20,374 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:20,374 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:20,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:20,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:20,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:20,510 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611730873]
[2025-05-07 17:25:20,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611730873] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:20,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:20,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:20,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105593641]
[2025-05-07 17:25:20,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:20,511 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:20,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:20,512 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:20,512 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,513 INFO  L87              Difference]: Start difference. First operand 146 states and 187 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:20,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:20,562 INFO  L93              Difference]: Finished difference Result 148 states and 188 transitions.
[2025-05-07 17:25:20,563 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:20,563 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:20,563 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:20,564 INFO  L225             Difference]: With dead ends: 148
[2025-05-07 17:25:20,564 INFO  L226             Difference]: Without dead ends: 142
[2025-05-07 17:25:20,564 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,565 INFO  L437           NwaCegarLoop]: 185 mSDtfsCounter, 1 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:20,565 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 728 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:20,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 142 states.
[2025-05-07 17:25:20,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142.
[2025-05-07 17:25:20,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 142 states, 64 states have (on average 1.046875) internal successors, (67), 67 states have internal predecessors, (67), 41 states have call successors, (57), 36 states have call predecessors, (57), 36 states have return successors, (57), 38 states have call predecessors, (57), 41 states have call successors, (57)
[2025-05-07 17:25:20,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions.
[2025-05-07 17:25:20,573 INFO  L79                 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 51
[2025-05-07 17:25:20,573 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:20,573 INFO  L485      AbstractCegarLoop]: Abstraction has 142 states and 181 transitions.
[2025-05-07 17:25:20,573 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:20,573 INFO  L278                IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions.
[2025-05-07 17:25:20,574 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:20,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:20,575 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:20,575 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:25:20,575 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:20,575 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:20,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -210003435, now seen corresponding path program 1 times
[2025-05-07 17:25:20,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:20,575 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656058404]
[2025-05-07 17:25:20,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:20,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:20,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:20,599 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:20,599 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:20,599 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:20,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:20,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:20,638 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656058404]
[2025-05-07 17:25:20,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656058404] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:20,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:20,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:20,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240739214]
[2025-05-07 17:25:20,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:20,639 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:20,639 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:20,640 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:20,640 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:20,640 INFO  L87              Difference]: Start difference. First operand 142 states and 181 transitions. Second operand  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:20,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:20,651 INFO  L93              Difference]: Finished difference Result 146 states and 186 transitions.
[2025-05-07 17:25:20,651 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:20,651 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:25:20,651 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:20,652 INFO  L225             Difference]: With dead ends: 146
[2025-05-07 17:25:20,652 INFO  L226             Difference]: Without dead ends: 142
[2025-05-07 17:25:20,653 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:20,653 INFO  L437           NwaCegarLoop]: 182 mSDtfsCounter, 1 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:20,653 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 538 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:20,654 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 142 states.
[2025-05-07 17:25:20,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140.
[2025-05-07 17:25:20,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 64 states have (on average 1.03125) internal successors, (66), 66 states have internal predecessors, (66), 39 states have call successors, (55), 36 states have call predecessors, (55), 36 states have return successors, (55), 37 states have call predecessors, (55), 39 states have call successors, (55)
[2025-05-07 17:25:20,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 176 transitions.
[2025-05-07 17:25:20,661 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 176 transitions. Word has length 51
[2025-05-07 17:25:20,661 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:20,661 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 176 transitions.
[2025-05-07 17:25:20,662 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:20,662 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 176 transitions.
[2025-05-07 17:25:20,663 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:20,663 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:20,663 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:20,663 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:25:20,663 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:20,663 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:20,663 INFO  L85        PathProgramCache]: Analyzing trace with hash 1316819327, now seen corresponding path program 1 times
[2025-05-07 17:25:20,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:20,664 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013112138]
[2025-05-07 17:25:20,664 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:20,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:20,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:20,686 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:20,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:20,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:20,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:20,815 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:20,815 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013112138]
[2025-05-07 17:25:20,815 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013112138] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:20,815 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:20,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:20,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557031325]
[2025-05-07 17:25:20,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:20,816 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:20,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:20,817 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:20,817 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,817 INFO  L87              Difference]: Start difference. First operand 140 states and 176 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:20,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:20,846 INFO  L93              Difference]: Finished difference Result 142 states and 177 transitions.
[2025-05-07 17:25:20,846 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:20,846 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:20,846 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:20,847 INFO  L225             Difference]: With dead ends: 142
[2025-05-07 17:25:20,847 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:25:20,847 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,848 INFO  L437           NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:20,848 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 681 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:20,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:25:20,853 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136.
[2025-05-07 17:25:20,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 38 states have call successors, (53), 35 states have call predecessors, (53), 35 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53)
[2025-05-07 17:25:20,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 170 transitions.
[2025-05-07 17:25:20,854 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 170 transitions. Word has length 51
[2025-05-07 17:25:20,854 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:20,854 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 170 transitions.
[2025-05-07 17:25:20,855 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:20,855 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 170 transitions.
[2025-05-07 17:25:20,855 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:20,855 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:20,855 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:20,856 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:25:20,856 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:20,856 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:20,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -344800231, now seen corresponding path program 1 times
[2025-05-07 17:25:20,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:20,856 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358035459]
[2025-05-07 17:25:20,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:20,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:20,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:20,879 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:20,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:20,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:20,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:20,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:20,977 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358035459]
[2025-05-07 17:25:20,977 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358035459] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:20,977 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:20,977 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:20,977 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306457628]
[2025-05-07 17:25:20,977 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:20,977 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:20,977 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:20,978 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:20,978 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:20,978 INFO  L87              Difference]: Start difference. First operand 136 states and 170 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,004 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,004 INFO  L93              Difference]: Finished difference Result 138 states and 171 transitions.
[2025-05-07 17:25:21,005 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:21,005 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,005 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,006 INFO  L225             Difference]: With dead ends: 138
[2025-05-07 17:25:21,006 INFO  L226             Difference]: Without dead ends: 132
[2025-05-07 17:25:21,006 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:21,007 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,007 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 660 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:21,007 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2025-05-07 17:25:21,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2025-05-07 17:25:21,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 37 states have call successors, (51), 34 states have call predecessors, (51), 34 states have return successors, (51), 35 states have call predecessors, (51), 37 states have call successors, (51)
[2025-05-07 17:25:21,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions.
[2025-05-07 17:25:21,012 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 51
[2025-05-07 17:25:21,012 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,013 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 164 transitions.
[2025-05-07 17:25:21,013 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,013 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions.
[2025-05-07 17:25:21,013 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,013 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,013 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,014 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:25:21,014 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,014 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -1223646151, now seen corresponding path program 1 times
[2025-05-07 17:25:21,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,014 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214074541]
[2025-05-07 17:25:21,014 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:21,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:21,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:21,041 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:21,041 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:21,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:21,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:21,105 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214074541]
[2025-05-07 17:25:21,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214074541] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:21,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:21,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:25:21,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702155121]
[2025-05-07 17:25:21,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:21,105 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:21,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:21,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:21,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:21,106 INFO  L87              Difference]: Start difference. First operand 132 states and 164 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,139 INFO  L93              Difference]: Finished difference Result 136 states and 168 transitions.
[2025-05-07 17:25:21,140 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:21,140 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,140 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,141 INFO  L225             Difference]: With dead ends: 136
[2025-05-07 17:25:21,141 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:25:21,141 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:21,141 INFO  L437           NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,141 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 812 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:21,142 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:25:21,146 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136.
[2025-05-07 17:25:21,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 37 states have call successors, (51), 34 states have call predecessors, (51), 36 states have return successors, (53), 37 states have call predecessors, (53), 37 states have call successors, (53)
[2025-05-07 17:25:21,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions.
[2025-05-07 17:25:21,147 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 51
[2025-05-07 17:25:21,147 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,147 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 168 transitions.
[2025-05-07 17:25:21,147 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,147 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions.
[2025-05-07 17:25:21,148 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,148 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,148 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,148 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:25:21,148 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,148 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,148 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669177239, now seen corresponding path program 1 times
[2025-05-07 17:25:21,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,149 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844303704]
[2025-05-07 17:25:21,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:21,163 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:21,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:21,169 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:21,169 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:21,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:21,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:21,222 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844303704]
[2025-05-07 17:25:21,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844303704] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:21,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:21,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:25:21,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138247402]
[2025-05-07 17:25:21,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:21,223 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:21,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:21,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:21,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:21,223 INFO  L87              Difference]: Start difference. First operand 136 states and 168 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,252 INFO  L93              Difference]: Finished difference Result 140 states and 172 transitions.
[2025-05-07 17:25:21,253 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:21,253 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,253 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,254 INFO  L225             Difference]: With dead ends: 140
[2025-05-07 17:25:21,254 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:25:21,254 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:21,255 INFO  L437           NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,255 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 812 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:21,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:25:21,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136.
[2025-05-07 17:25:21,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 37 states have call successors, (51), 34 states have call predecessors, (51), 36 states have return successors, (53), 37 states have call predecessors, (53), 37 states have call successors, (53)
[2025-05-07 17:25:21,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions.
[2025-05-07 17:25:21,261 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 51
[2025-05-07 17:25:21,261 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,261 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 168 transitions.
[2025-05-07 17:25:21,261 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,262 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions.
[2025-05-07 17:25:21,262 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,262 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,262 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:25:21,262 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,263 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 1567397865, now seen corresponding path program 1 times
[2025-05-07 17:25:21,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,263 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102180453]
[2025-05-07 17:25:21,263 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:21,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:21,291 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:21,291 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:21,291 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:21,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:21,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:21,446 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102180453]
[2025-05-07 17:25:21,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102180453] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:21,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:21,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:25:21,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554865952]
[2025-05-07 17:25:21,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:21,447 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:25:21,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:21,447 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:25:21,448 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:25:21,448 INFO  L87              Difference]: Start difference. First operand 136 states and 168 transitions. Second operand  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:21,544 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,544 INFO  L93              Difference]: Finished difference Result 140 states and 172 transitions.
[2025-05-07 17:25:21,544 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:25:21,544 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,545 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,545 INFO  L225             Difference]: With dead ends: 140
[2025-05-07 17:25:21,545 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:25:21,545 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:25:21,546 INFO  L437           NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,546 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1063 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:21,546 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:25:21,550 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136.
[2025-05-07 17:25:21,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 37 states have call successors, (51), 34 states have call predecessors, (51), 36 states have return successors, (53), 37 states have call predecessors, (53), 37 states have call successors, (53)
[2025-05-07 17:25:21,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions.
[2025-05-07 17:25:21,551 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 51
[2025-05-07 17:25:21,551 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,551 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 168 transitions.
[2025-05-07 17:25:21,551 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:25:21,551 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions.
[2025-05-07 17:25:21,552 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,552 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,552 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,552 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:25:21,552 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,552 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 1028021647, now seen corresponding path program 1 times
[2025-05-07 17:25:21,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,552 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940905121]
[2025-05-07 17:25:21,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:21,571 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:21,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:21,578 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:21,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:21,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:21,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:21,652 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940905121]
[2025-05-07 17:25:21,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940905121] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:21,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:21,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:21,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993911252]
[2025-05-07 17:25:21,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:21,653 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:21,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:21,654 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:21,654 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:21,654 INFO  L87              Difference]: Start difference. First operand 136 states and 168 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,683 INFO  L93              Difference]: Finished difference Result 138 states and 169 transitions.
[2025-05-07 17:25:21,683 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:21,683 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,683 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,684 INFO  L225             Difference]: With dead ends: 138
[2025-05-07 17:25:21,684 INFO  L226             Difference]: Without dead ends: 132
[2025-05-07 17:25:21,685 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:21,685 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,685 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 636 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:21,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2025-05-07 17:25:21,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2025-05-07 17:25:21,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 36 states have call successors, (49), 33 states have call predecessors, (49), 35 states have return successors, (51), 36 states have call predecessors, (51), 36 states have call successors, (51)
[2025-05-07 17:25:21,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions.
[2025-05-07 17:25:21,690 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 51
[2025-05-07 17:25:21,690 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,690 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 162 transitions.
[2025-05-07 17:25:21,690 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,691 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2025-05-07 17:25:21,691 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,691 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,691 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:25:21,691 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,692 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 724329935, now seen corresponding path program 1 times
[2025-05-07 17:25:21,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,692 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031625332]
[2025-05-07 17:25:21,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:21,706 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:21,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:21,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:21,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:21,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:21,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:21,758 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031625332]
[2025-05-07 17:25:21,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031625332] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:21,758 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:21,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:25:21,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874923481]
[2025-05-07 17:25:21,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:21,759 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:21,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:21,759 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:21,759 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:21,760 INFO  L87              Difference]: Start difference. First operand 132 states and 162 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,791 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,791 INFO  L93              Difference]: Finished difference Result 136 states and 166 transitions.
[2025-05-07 17:25:21,791 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:21,791 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,792 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,792 INFO  L225             Difference]: With dead ends: 136
[2025-05-07 17:25:21,792 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:25:21,792 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:21,793 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,793 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 782 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:21,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:25:21,796 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132.
[2025-05-07 17:25:21,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 36 states have call successors, (49), 33 states have call predecessors, (49), 35 states have return successors, (51), 36 states have call predecessors, (51), 36 states have call successors, (51)
[2025-05-07 17:25:21,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions.
[2025-05-07 17:25:21,797 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 51
[2025-05-07 17:25:21,797 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,797 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 162 transitions.
[2025-05-07 17:25:21,797 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,798 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2025-05-07 17:25:21,798 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,798 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,798 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,798 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:25:21,798 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,799 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -1556659891, now seen corresponding path program 1 times
[2025-05-07 17:25:21,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,799 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001664961]
[2025-05-07 17:25:21,799 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,799 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:21,817 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:21,822 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:21,822 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:21,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:21,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:21,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:21,942 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001664961]
[2025-05-07 17:25:21,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001664961] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:21,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:21,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:21,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211312754]
[2025-05-07 17:25:21,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:21,943 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:21,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:21,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:21,944 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:21,944 INFO  L87              Difference]: Start difference. First operand 132 states and 162 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:21,973 INFO  L93              Difference]: Finished difference Result 134 states and 163 transitions.
[2025-05-07 17:25:21,974 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:21,974 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:21,974 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:21,975 INFO  L225             Difference]: With dead ends: 134
[2025-05-07 17:25:21,975 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:25:21,975 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:21,975 INFO  L437           NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:21,975 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 612 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:21,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:25:21,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128.
[2025-05-07 17:25:21,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 60 states have internal predecessors, (60), 35 states have call successors, (47), 32 states have call predecessors, (47), 34 states have return successors, (49), 35 states have call predecessors, (49), 35 states have call successors, (49)
[2025-05-07 17:25:21,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions.
[2025-05-07 17:25:21,980 INFO  L79                 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 51
[2025-05-07 17:25:21,980 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:21,980 INFO  L485      AbstractCegarLoop]: Abstraction has 128 states and 156 transitions.
[2025-05-07 17:25:21,980 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:21,980 INFO  L278                IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions.
[2025-05-07 17:25:21,981 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:25:21,981 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:21,981 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:21,981 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:25:21,982 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:21,982 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:21,982 INFO  L85        PathProgramCache]: Analyzing trace with hash -1715357167, now seen corresponding path program 1 times
[2025-05-07 17:25:21,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:21,982 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025708274]
[2025-05-07 17:25:21,982 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:21,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:22,006 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:25:22,013 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:25:22,013 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:22,013 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:22,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:22,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:22,094 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025708274]
[2025-05-07 17:25:22,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025708274] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:22,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:22,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:25:22,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91940035]
[2025-05-07 17:25:22,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:22,094 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:22,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:22,095 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:22,095 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:22,095 INFO  L87              Difference]: Start difference. First operand 128 states and 156 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:22,118 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:22,118 INFO  L93              Difference]: Finished difference Result 120 states and 147 transitions.
[2025-05-07 17:25:22,119 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:22,119 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:25:22,119 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:22,119 INFO  L225             Difference]: With dead ends: 120
[2025-05-07 17:25:22,119 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:25:22,119 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:22,120 INFO  L437           NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:22,120 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:22,120 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:25:22,120 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:25:22,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:25:22,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:25:22,121 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51
[2025-05-07 17:25:22,121 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:22,121 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:25:22,121 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:25:22,121 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:25:22,121 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:25:22,123 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:25:22,123 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:25:22,125 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:22,127 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:25:22,129 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:25:22 BoogieIcfgContainer
[2025-05-07 17:25:22,129 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:25:22,129 INFO  L158              Benchmark]: Toolchain (without parser) took 3237.31ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 124.9MB in the beginning and 143.9MB in the end (delta: -19.1MB). Peak memory consumption was 34.6MB. Max. memory is 33.6GB.
[2025-05-07 17:25:22,129 INFO  L158              Benchmark]: SmtParser took 0.20ms. Allocated memory is still 234.9MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:22,130 INFO  L158              Benchmark]: ChcToBoogie took 53.52ms. Allocated memory is still 234.9MB. Free memory was 124.8MB in the beginning and 193.1MB in the end (delta: -68.3MB). Peak memory consumption was 24.5MB. Max. memory is 33.6GB.
[2025-05-07 17:25:22,130 INFO  L158              Benchmark]: Boogie Preprocessor took 64.47ms. Allocated memory is still 234.9MB. Free memory was 193.1MB in the beginning and 188.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:22,130 INFO  L158              Benchmark]: RCFGBuilder took 579.05ms. Allocated memory is still 234.9MB. Free memory was 188.7MB in the beginning and 119.9MB in the end (delta: 68.7MB). Peak memory consumption was 67.1MB. Max. memory is 33.6GB.
[2025-05-07 17:25:22,130 INFO  L158              Benchmark]: TraceAbstraction took 2536.61ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 119.5MB in the beginning and 143.9MB in the end (delta: -24.5MB). Peak memory consumption was 26.9MB. Max. memory is 33.6GB.
[2025-05-07 17:25:22,131 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.20ms. Allocated memory is still 234.9MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 53.52ms. Allocated memory is still 234.9MB. Free memory was 124.8MB in the beginning and 193.1MB in the end (delta: -68.3MB). Peak memory consumption was 24.5MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 64.47ms. Allocated memory is still 234.9MB. Free memory was 193.1MB in the beginning and 188.7MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 579.05ms. Allocated memory is still 234.9MB. Free memory was 188.7MB in the beginning and 119.9MB in the end (delta: 68.7MB). Peak memory consumption was 67.1MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2536.61ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 119.5MB in the beginning and 143.9MB in the end (delta: -24.5MB). Peak memory consumption was 26.9MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 39 procedures, 152 locations, 256 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 8641 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6636 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 2005 mSDtfsCounter, 233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:25:22,141 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
