./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:25:38,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:25:38,826 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 16:25:38,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:25:38,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:25:38,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:25:38,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:25:38,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:25:38,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:25:38,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:25:38,873 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 16:25:38,873 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 16:25:38,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 16:25:38,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:25:38,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:25:38,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:25:38,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:25:38,877 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 16:25:38,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:25:38,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:25:38,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:25:38,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:25:38,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:25:38,879 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 16:25:38,879 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fd6142dd23f608c3bc9ae24389b4aee583128e9e6b549483298584de0c08ecd [2024-11-13 16:25:39,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:25:39,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:25:39,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:25:39,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:25:39,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:25:39,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_13.c Unable to find full path for "g++" [2024-11-13 16:25:41,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:25:41,451 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:25:41,452 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/sv-benchmarks/c/locks/test_locks_13.c [2024-11-13 16:25:41,477 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/data/1724a1e18/25f78b9873f040f5b1c3174ac40984e0/FLAGbbbdb661e [2024-11-13 16:25:41,534 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/data/1724a1e18/25f78b9873f040f5b1c3174ac40984e0 [2024-11-13 16:25:41,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:25:41,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:25:41,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:25:41,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:25:41,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:25:41,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a08d795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41, skipping insertion in model container [2024-11-13 16:25:41,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:25:41,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:25:41,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:25:41,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:25:41,877 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:25:41,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41 WrapperNode [2024-11-13 16:25:41,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:25:41,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:25:41,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:25:41,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:25:41,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,924 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 170 [2024-11-13 16:25:41,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:25:41,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:25:41,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:25:41,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:25:41,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,956 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 16:25:41,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:25:41,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:25:41,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:25:41,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:25:41,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (1/1) ... [2024-11-13 16:25:41,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:25:42,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:25:42,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:25:42,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 16:25:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:25:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:25:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:25:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:25:42,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:25:42,140 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:25:42,452 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-13 16:25:42,452 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:25:42,470 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:25:42,471 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:25:42,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:25:42 BoogieIcfgContainer [2024-11-13 16:25:42,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:25:42,472 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 16:25:42,472 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 16:25:42,480 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 16:25:42,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:25:42,481 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 04:25:41" (1/3) ... [2024-11-13 16:25:42,482 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30429ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:25:42, skipping insertion in model container [2024-11-13 16:25:42,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:25:42,485 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:25:41" (2/3) ... [2024-11-13 16:25:42,485 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30429ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:25:42, skipping insertion in model container [2024-11-13 16:25:42,487 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:25:42,487 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:25:42" (3/3) ... [2024-11-13 16:25:42,489 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_13.c [2024-11-13 16:25:42,562 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 16:25:42,563 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 16:25:42,563 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 16:25:42,563 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 16:25:42,563 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 16:25:42,564 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 16:25:42,564 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 16:25:42,565 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 16:25:42,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 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) [2024-11-13 16:25:42,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2024-11-13 16:25:42,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:42,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:42,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:42,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:42,603 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 16:25:42,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 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) [2024-11-13 16:25:42,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2024-11-13 16:25:42,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:42,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:42,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:42,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:42,621 INFO L745 eck$LassoCheckResult]: Stem: 22#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 28#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 10#L197-1true [2024-11-13 16:25:42,622 INFO L747 eck$LassoCheckResult]: Loop: 10#L197-1true assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 48#L52true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 15#L83true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 31#L83-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 7#L87-1true assume !(0 != main_~p3~0#1); 27#L91-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 25#L95-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 32#L99-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 29#L103-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 38#L107-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L111-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 43#L115-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17#L119-1true assume !(0 != main_~p11~0#1); 26#L123-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14#L127-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 18#L131-1true assume !(0 != main_~p1~0#1); 9#L137-1true assume !(0 != main_~p2~0#1); 5#L142-1true assume !(0 != main_~p3~0#1); 45#L147-1true assume !(0 != main_~p4~0#1); 8#L152-1true assume !(0 != main_~p5~0#1); 12#L157-1true assume !(0 != main_~p6~0#1); 34#L162-1true assume !(0 != main_~p7~0#1); 35#L167-1true assume !(0 != main_~p8~0#1); 36#L172-1true assume !(0 != main_~p9~0#1); 42#L177-1true assume !(0 != main_~p10~0#1); 49#L182-1true assume !(0 != main_~p11~0#1); 24#L187-1true assume !(0 != main_~p12~0#1); 46#L192-1true assume !(0 != main_~p13~0#1); 10#L197-1true [2024-11-13 16:25:42,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 16:25:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:42,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615031928] [2024-11-13 16:25:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:42,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:42,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -391818443, now seen corresponding path program 1 times [2024-11-13 16:25:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095045618] [2024-11-13 16:25:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095045618] [2024-11-13 16:25:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095045618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:42,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770195094] [2024-11-13 16:25:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:42,918 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:42,954 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.875) internal successors, (90), 48 states have internal predecessors, (90), 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) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:43,018 INFO L93 Difference]: Finished difference Result 91 states and 165 transitions. [2024-11-13 16:25:43,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 165 transitions. [2024-11-13 16:25:43,023 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2024-11-13 16:25:43,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 83 states and 133 transitions. [2024-11-13 16:25:43,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-13 16:25:43,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-13 16:25:43,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 133 transitions. [2024-11-13 16:25:43,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:43,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-11-13 16:25:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 133 transitions. [2024-11-13 16:25:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-13 16:25:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 82 states have internal predecessors, (133), 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) [2024-11-13 16:25:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2024-11-13 16:25:43,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-11-13 16:25:43,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:43,081 INFO L424 stractBuchiCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-11-13 16:25:43,081 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 16:25:43,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 133 transitions. [2024-11-13 16:25:43,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2024-11-13 16:25:43,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:43,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:43,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:43,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:43,085 INFO L745 eck$LassoCheckResult]: Stem: 195#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 156#L197-1 [2024-11-13 16:25:43,085 INFO L747 eck$LassoCheckResult]: Loop: 156#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 196#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 197#L83 assume !(0 != main_~p1~0#1); 199#L83-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 231#L87-1 assume !(0 != main_~p3~0#1); 230#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 229#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 228#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 227#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 226#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 225#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 224#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 223#L119-1 assume !(0 != main_~p11~0#1); 222#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 221#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 220#L131-1 assume !(0 != main_~p1~0#1); 219#L137-1 assume !(0 != main_~p2~0#1); 217#L142-1 assume !(0 != main_~p3~0#1); 215#L147-1 assume !(0 != main_~p4~0#1); 213#L152-1 assume !(0 != main_~p5~0#1); 178#L157-1 assume !(0 != main_~p6~0#1); 174#L162-1 assume !(0 != main_~p7~0#1); 154#L167-1 assume !(0 != main_~p8~0#1); 207#L172-1 assume !(0 != main_~p9~0#1); 205#L177-1 assume !(0 != main_~p10~0#1); 203#L182-1 assume !(0 != main_~p11~0#1); 198#L187-1 assume !(0 != main_~p12~0#1); 187#L192-1 assume !(0 != main_~p13~0#1); 156#L197-1 [2024-11-13 16:25:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 16:25:43,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381727533] [2024-11-13 16:25:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:43,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,113 INFO L85 PathProgramCache]: Analyzing trace with hash -329778829, now seen corresponding path program 1 times [2024-11-13 16:25:43,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718001409] [2024-11-13 16:25:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:43,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718001409] [2024-11-13 16:25:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718001409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:43,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:43,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427332744] [2024-11-13 16:25:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:43,213 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:43,215 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:43,244 INFO L93 Difference]: Finished difference Result 162 states and 258 transitions. [2024-11-13 16:25:43,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 258 transitions. [2024-11-13 16:25:43,248 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2024-11-13 16:25:43,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 258 transitions. [2024-11-13 16:25:43,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2024-11-13 16:25:43,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2024-11-13 16:25:43,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 258 transitions. [2024-11-13 16:25:43,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:43,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-11-13 16:25:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 258 transitions. [2024-11-13 16:25:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-13 16:25:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.5925925925925926) internal successors, (258), 161 states have internal predecessors, (258), 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) [2024-11-13 16:25:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 258 transitions. [2024-11-13 16:25:43,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-11-13 16:25:43,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:43,283 INFO L424 stractBuchiCegarLoop]: Abstraction has 162 states and 258 transitions. [2024-11-13 16:25:43,283 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 16:25:43,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 258 transitions. [2024-11-13 16:25:43,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 160 [2024-11-13 16:25:43,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:43,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:43,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:43,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:43,289 INFO L745 eck$LassoCheckResult]: Stem: 456#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 406#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 407#L197-1 [2024-11-13 16:25:43,289 INFO L747 eck$LassoCheckResult]: Loop: 407#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 506#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 504#L83 assume !(0 != main_~p1~0#1); 502#L83-2 assume !(0 != main_~p2~0#1); 501#L87-1 assume !(0 != main_~p3~0#1); 500#L91-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 496#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 497#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 492#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 493#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 422#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 423#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 452#L119-1 assume !(0 != main_~p11~0#1); 453#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 442#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 443#L131-1 assume !(0 != main_~p1~0#1); 499#L137-1 assume !(0 != main_~p2~0#1); 480#L142-1 assume !(0 != main_~p3~0#1); 478#L147-1 assume !(0 != main_~p4~0#1); 417#L152-1 assume !(0 != main_~p5~0#1); 418#L157-1 assume !(0 != main_~p6~0#1); 429#L162-1 assume !(0 != main_~p7~0#1); 403#L167-1 assume !(0 != main_~p8~0#1); 438#L172-1 assume !(0 != main_~p9~0#1); 440#L177-1 assume !(0 != main_~p10~0#1); 512#L182-1 assume !(0 != main_~p11~0#1); 509#L187-1 assume !(0 != main_~p12~0#1); 508#L192-1 assume !(0 != main_~p13~0#1); 407#L197-1 [2024-11-13 16:25:43,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 16:25:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554194129] [2024-11-13 16:25:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:43,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash -189230219, now seen corresponding path program 1 times [2024-11-13 16:25:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851304093] [2024-11-13 16:25:43,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851304093] [2024-11-13 16:25:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851304093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:43,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:43,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508618616] [2024-11-13 16:25:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:43,407 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:43,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:43,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:43,408 INFO L87 Difference]: Start difference. First operand 162 states and 258 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:43,449 INFO L93 Difference]: Finished difference Result 318 states and 502 transitions. [2024-11-13 16:25:43,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 502 transitions. [2024-11-13 16:25:43,457 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2024-11-13 16:25:43,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 318 states and 502 transitions. [2024-11-13 16:25:43,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2024-11-13 16:25:43,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2024-11-13 16:25:43,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 502 transitions. [2024-11-13 16:25:43,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:43,467 INFO L218 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2024-11-13 16:25:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 502 transitions. [2024-11-13 16:25:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-13 16:25:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.578616352201258) internal successors, (502), 317 states have internal predecessors, (502), 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) [2024-11-13 16:25:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 502 transitions. [2024-11-13 16:25:43,496 INFO L240 hiAutomatonCegarLoop]: Abstraction has 318 states and 502 transitions. [2024-11-13 16:25:43,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:43,499 INFO L424 stractBuchiCegarLoop]: Abstraction has 318 states and 502 transitions. [2024-11-13 16:25:43,499 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 16:25:43,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 502 transitions. [2024-11-13 16:25:43,503 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 316 [2024-11-13 16:25:43,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:43,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:43,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:43,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:43,504 INFO L745 eck$LassoCheckResult]: Stem: 939#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 892#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 893#L197-1 [2024-11-13 16:25:43,505 INFO L747 eck$LassoCheckResult]: Loop: 893#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 987#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 985#L83 assume !(0 != main_~p1~0#1); 981#L83-2 assume !(0 != main_~p2~0#1); 979#L87-1 assume !(0 != main_~p3~0#1); 976#L91-1 assume !(0 != main_~p4~0#1); 974#L95-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 972#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 970#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 968#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 966#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 964#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 962#L119-1 assume !(0 != main_~p11~0#1); 960#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 958#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 955#L131-1 assume !(0 != main_~p1~0#1); 956#L137-1 assume !(0 != main_~p2~0#1); 1031#L142-1 assume !(0 != main_~p3~0#1); 1026#L147-1 assume !(0 != main_~p4~0#1); 1023#L152-1 assume !(0 != main_~p5~0#1); 1019#L157-1 assume !(0 != main_~p6~0#1); 1015#L162-1 assume !(0 != main_~p7~0#1); 1011#L167-1 assume !(0 != main_~p8~0#1); 1007#L172-1 assume !(0 != main_~p9~0#1); 1003#L177-1 assume !(0 != main_~p10~0#1); 999#L182-1 assume !(0 != main_~p11~0#1); 994#L187-1 assume !(0 != main_~p12~0#1); 991#L192-1 assume !(0 != main_~p13~0#1); 893#L197-1 [2024-11-13 16:25:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 16:25:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809424175] [2024-11-13 16:25:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1994668553, now seen corresponding path program 1 times [2024-11-13 16:25:43,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556761237] [2024-11-13 16:25:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:43,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556761237] [2024-11-13 16:25:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556761237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16274081] [2024-11-13 16:25:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:43,585 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:43,586 INFO L87 Difference]: Start difference. First operand 318 states and 502 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:43,629 INFO L93 Difference]: Finished difference Result 626 states and 978 transitions. [2024-11-13 16:25:43,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 626 states and 978 transitions. [2024-11-13 16:25:43,641 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2024-11-13 16:25:43,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 626 states to 626 states and 978 transitions. [2024-11-13 16:25:43,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2024-11-13 16:25:43,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2024-11-13 16:25:43,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 978 transitions. [2024-11-13 16:25:43,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:43,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2024-11-13 16:25:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 978 transitions. [2024-11-13 16:25:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2024-11-13 16:25:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 626 states have (on average 1.5623003194888179) internal successors, (978), 625 states have internal predecessors, (978), 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) [2024-11-13 16:25:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 978 transitions. [2024-11-13 16:25:43,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 626 states and 978 transitions. [2024-11-13 16:25:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:43,687 INFO L424 stractBuchiCegarLoop]: Abstraction has 626 states and 978 transitions. [2024-11-13 16:25:43,689 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 16:25:43,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 626 states and 978 transitions. [2024-11-13 16:25:43,693 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 624 [2024-11-13 16:25:43,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:43,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:43,696 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:43,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:43,696 INFO L745 eck$LassoCheckResult]: Stem: 1885#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1842#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 1843#L197-1 [2024-11-13 16:25:43,696 INFO L747 eck$LassoCheckResult]: Loop: 1843#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 1937#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 1935#L83 assume !(0 != main_~p1~0#1); 1931#L83-2 assume !(0 != main_~p2~0#1); 1929#L87-1 assume !(0 != main_~p3~0#1); 1925#L91-1 assume !(0 != main_~p4~0#1); 1921#L95-1 assume !(0 != main_~p5~0#1); 1919#L99-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1917#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1915#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1913#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1911#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1909#L119-1 assume !(0 != main_~p11~0#1); 1907#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1905#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1902#L131-1 assume !(0 != main_~p1~0#1); 1903#L137-1 assume !(0 != main_~p2~0#1); 1981#L142-1 assume !(0 != main_~p3~0#1); 1976#L147-1 assume !(0 != main_~p4~0#1); 1972#L152-1 assume !(0 != main_~p5~0#1); 1969#L157-1 assume !(0 != main_~p6~0#1); 1965#L162-1 assume !(0 != main_~p7~0#1); 1961#L167-1 assume !(0 != main_~p8~0#1); 1957#L172-1 assume !(0 != main_~p9~0#1); 1953#L177-1 assume !(0 != main_~p10~0#1); 1949#L182-1 assume !(0 != main_~p11~0#1); 1944#L187-1 assume !(0 != main_~p12~0#1); 1941#L192-1 assume !(0 != main_~p13~0#1); 1843#L197-1 [2024-11-13 16:25:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 16:25:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914894743] [2024-11-13 16:25:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1775813835, now seen corresponding path program 1 times [2024-11-13 16:25:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529514657] [2024-11-13 16:25:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:43,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529514657] [2024-11-13 16:25:43,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529514657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:43,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:43,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:43,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261002457] [2024-11-13 16:25:43,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:43,777 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:43,778 INFO L87 Difference]: Start difference. First operand 626 states and 978 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:43,803 INFO L93 Difference]: Finished difference Result 1234 states and 1906 transitions. [2024-11-13 16:25:43,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 1906 transitions. [2024-11-13 16:25:43,814 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2024-11-13 16:25:43,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1234 states and 1906 transitions. [2024-11-13 16:25:43,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1234 [2024-11-13 16:25:43,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1234 [2024-11-13 16:25:43,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1234 states and 1906 transitions. [2024-11-13 16:25:43,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:43,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2024-11-13 16:25:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states and 1906 transitions. [2024-11-13 16:25:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2024-11-13 16:25:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1234 states have (on average 1.5445705024311183) internal successors, (1906), 1233 states have internal predecessors, (1906), 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) [2024-11-13 16:25:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1906 transitions. [2024-11-13 16:25:43,860 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2024-11-13 16:25:43,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:43,861 INFO L424 stractBuchiCegarLoop]: Abstraction has 1234 states and 1906 transitions. [2024-11-13 16:25:43,861 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 16:25:43,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1234 states and 1906 transitions. [2024-11-13 16:25:43,869 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1232 [2024-11-13 16:25:43,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:43,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:43,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:43,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:43,870 INFO L745 eck$LassoCheckResult]: Stem: 3750#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3708#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 3709#L197-1 [2024-11-13 16:25:43,870 INFO L747 eck$LassoCheckResult]: Loop: 3709#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 3835#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 3831#L83 assume !(0 != main_~p1~0#1); 3824#L83-2 assume !(0 != main_~p2~0#1); 3819#L87-1 assume !(0 != main_~p3~0#1); 3812#L91-1 assume !(0 != main_~p4~0#1); 3804#L95-1 assume !(0 != main_~p5~0#1); 3798#L99-1 assume !(0 != main_~p6~0#1); 3793#L103-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3794#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3787#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3788#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3781#L119-1 assume !(0 != main_~p11~0#1); 3782#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3775#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 3776#L131-1 assume !(0 != main_~p1~0#1); 3902#L137-1 assume !(0 != main_~p2~0#1); 3897#L142-1 assume !(0 != main_~p3~0#1); 3892#L147-1 assume !(0 != main_~p4~0#1); 3889#L152-1 assume !(0 != main_~p5~0#1); 3887#L157-1 assume !(0 != main_~p6~0#1); 3884#L162-1 assume !(0 != main_~p7~0#1); 3880#L167-1 assume !(0 != main_~p8~0#1); 3876#L172-1 assume !(0 != main_~p9~0#1); 3860#L177-1 assume !(0 != main_~p10~0#1); 3852#L182-1 assume !(0 != main_~p11~0#1); 3847#L187-1 assume !(0 != main_~p12~0#1); 3844#L192-1 assume !(0 != main_~p13~0#1); 3709#L197-1 [2024-11-13 16:25:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-13 16:25:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474333977] [2024-11-13 16:25:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:43,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1353112009, now seen corresponding path program 1 times [2024-11-13 16:25:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606787883] [2024-11-13 16:25:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606787883] [2024-11-13 16:25:43,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606787883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:43,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:43,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848702708] [2024-11-13 16:25:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:43,937 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:43,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:43,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:43,937 INFO L87 Difference]: Start difference. First operand 1234 states and 1906 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:43,982 INFO L93 Difference]: Finished difference Result 2434 states and 3714 transitions. [2024-11-13 16:25:43,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2434 states and 3714 transitions. [2024-11-13 16:25:44,013 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2024-11-13 16:25:44,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2434 states to 2434 states and 3714 transitions. [2024-11-13 16:25:44,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2434 [2024-11-13 16:25:44,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2434 [2024-11-13 16:25:44,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2434 states and 3714 transitions. [2024-11-13 16:25:44,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:44,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2024-11-13 16:25:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states and 3714 transitions. [2024-11-13 16:25:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2024-11-13 16:25:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2434 states have (on average 1.5258833196384551) internal successors, (3714), 2433 states have internal predecessors, (3714), 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) [2024-11-13 16:25:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3714 transitions. [2024-11-13 16:25:44,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2024-11-13 16:25:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:44,126 INFO L424 stractBuchiCegarLoop]: Abstraction has 2434 states and 3714 transitions. [2024-11-13 16:25:44,126 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 16:25:44,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2434 states and 3714 transitions. [2024-11-13 16:25:44,147 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2432 [2024-11-13 16:25:44,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:44,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:44,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:44,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:44,149 INFO L745 eck$LassoCheckResult]: Stem: 7426#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7382#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 7383#L197-1 [2024-11-13 16:25:44,150 INFO L747 eck$LassoCheckResult]: Loop: 7383#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 7679#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 7676#L83 assume !(0 != main_~p1~0#1); 7673#L83-2 assume !(0 != main_~p2~0#1); 7669#L87-1 assume !(0 != main_~p3~0#1); 7664#L91-1 assume !(0 != main_~p4~0#1); 7665#L95-1 assume !(0 != main_~p5~0#1); 7690#L99-1 assume !(0 != main_~p6~0#1); 7686#L103-1 assume !(0 != main_~p7~0#1); 7685#L107-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 7681#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7680#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 7678#L119-1 assume !(0 != main_~p11~0#1); 7675#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7670#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 7666#L131-1 assume !(0 != main_~p1~0#1); 7661#L137-1 assume !(0 != main_~p2~0#1); 7585#L142-1 assume !(0 != main_~p3~0#1); 7584#L147-1 assume !(0 != main_~p4~0#1); 7625#L152-1 assume !(0 != main_~p5~0#1); 7730#L157-1 assume !(0 != main_~p6~0#1); 7726#L162-1 assume !(0 != main_~p7~0#1); 7723#L167-1 assume !(0 != main_~p8~0#1); 7719#L172-1 assume !(0 != main_~p9~0#1); 7715#L177-1 assume !(0 != main_~p10~0#1); 7713#L182-1 assume !(0 != main_~p11~0#1); 7696#L187-1 assume !(0 != main_~p12~0#1); 7684#L192-1 assume !(0 != main_~p13~0#1); 7383#L197-1 [2024-11-13 16:25:44,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-13 16:25:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900994431] [2024-11-13 16:25:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:44,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:44,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:44,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2124206837, now seen corresponding path program 1 times [2024-11-13 16:25:44,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:44,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926465199] [2024-11-13 16:25:44,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:44,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:44,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926465199] [2024-11-13 16:25:44,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926465199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:44,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:44,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050440897] [2024-11-13 16:25:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:44,231 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:44,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:44,232 INFO L87 Difference]: Start difference. First operand 2434 states and 3714 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:44,292 INFO L93 Difference]: Finished difference Result 4802 states and 7234 transitions. [2024-11-13 16:25:44,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4802 states and 7234 transitions. [2024-11-13 16:25:44,344 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2024-11-13 16:25:44,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4802 states to 4802 states and 7234 transitions. [2024-11-13 16:25:44,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4802 [2024-11-13 16:25:44,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4802 [2024-11-13 16:25:44,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4802 states and 7234 transitions. [2024-11-13 16:25:44,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:44,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2024-11-13 16:25:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states and 7234 transitions. [2024-11-13 16:25:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4802. [2024-11-13 16:25:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4802 states have (on average 1.5064556434818825) internal successors, (7234), 4801 states have internal predecessors, (7234), 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) [2024-11-13 16:25:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7234 transitions. [2024-11-13 16:25:44,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2024-11-13 16:25:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:44,544 INFO L424 stractBuchiCegarLoop]: Abstraction has 4802 states and 7234 transitions. [2024-11-13 16:25:44,544 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 16:25:44,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4802 states and 7234 transitions. [2024-11-13 16:25:44,578 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4800 [2024-11-13 16:25:44,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:44,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:44,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:44,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:44,580 INFO L745 eck$LassoCheckResult]: Stem: 14669#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 14624#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 14625#L197-1 [2024-11-13 16:25:44,581 INFO L747 eck$LassoCheckResult]: Loop: 14625#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 15162#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 15160#L83 assume !(0 != main_~p1~0#1); 15157#L83-2 assume !(0 != main_~p2~0#1); 15155#L87-1 assume !(0 != main_~p3~0#1); 15153#L91-1 assume !(0 != main_~p4~0#1); 14973#L95-1 assume !(0 != main_~p5~0#1); 14975#L99-1 assume !(0 != main_~p6~0#1); 14957#L103-1 assume !(0 != main_~p7~0#1); 14954#L107-1 assume !(0 != main_~p8~0#1); 14951#L111-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 14952#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 14946#L119-1 assume !(0 != main_~p11~0#1); 14947#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14939#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 14940#L131-1 assume !(0 != main_~p1~0#1); 14930#L137-1 assume !(0 != main_~p2~0#1); 14931#L142-1 assume !(0 != main_~p3~0#1); 15114#L147-1 assume !(0 != main_~p4~0#1); 15098#L152-1 assume !(0 != main_~p5~0#1); 15055#L157-1 assume !(0 != main_~p6~0#1); 15057#L162-1 assume !(0 != main_~p7~0#1); 15101#L167-1 assume !(0 != main_~p8~0#1); 15172#L172-1 assume !(0 != main_~p9~0#1); 15170#L177-1 assume !(0 != main_~p10~0#1); 15168#L182-1 assume !(0 != main_~p11~0#1); 15165#L187-1 assume !(0 != main_~p12~0#1); 15164#L192-1 assume !(0 != main_~p13~0#1); 14625#L197-1 [2024-11-13 16:25:44,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-13 16:25:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555183602] [2024-11-13 16:25:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:44,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:44,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash 435263095, now seen corresponding path program 1 times [2024-11-13 16:25:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928842966] [2024-11-13 16:25:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:44,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928842966] [2024-11-13 16:25:44,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928842966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:44,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560511376] [2024-11-13 16:25:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:44,647 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:44,648 INFO L87 Difference]: Start difference. First operand 4802 states and 7234 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:44,722 INFO L93 Difference]: Finished difference Result 9474 states and 14082 transitions. [2024-11-13 16:25:44,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9474 states and 14082 transitions. [2024-11-13 16:25:44,792 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2024-11-13 16:25:44,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9474 states to 9474 states and 14082 transitions. [2024-11-13 16:25:44,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9474 [2024-11-13 16:25:44,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9474 [2024-11-13 16:25:44,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9474 states and 14082 transitions. [2024-11-13 16:25:44,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:44,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2024-11-13 16:25:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states and 14082 transitions. [2024-11-13 16:25:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 9474. [2024-11-13 16:25:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9474 states, 9474 states have (on average 1.486383787207093) internal successors, (14082), 9473 states have internal predecessors, (14082), 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) [2024-11-13 16:25:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9474 states to 9474 states and 14082 transitions. [2024-11-13 16:25:45,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2024-11-13 16:25:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:45,141 INFO L424 stractBuchiCegarLoop]: Abstraction has 9474 states and 14082 transitions. [2024-11-13 16:25:45,141 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 16:25:45,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9474 states and 14082 transitions. [2024-11-13 16:25:45,228 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 9472 [2024-11-13 16:25:45,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:45,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:45,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:45,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:45,229 INFO L745 eck$LassoCheckResult]: Stem: 28954#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 28906#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 28907#L197-1 [2024-11-13 16:25:45,229 INFO L747 eck$LassoCheckResult]: Loop: 28907#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 29529#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 29527#L83 assume !(0 != main_~p1~0#1); 29525#L83-2 assume !(0 != main_~p2~0#1); 29523#L87-1 assume !(0 != main_~p3~0#1); 29521#L91-1 assume !(0 != main_~p4~0#1); 29518#L95-1 assume !(0 != main_~p5~0#1); 29514#L99-1 assume !(0 != main_~p6~0#1); 29510#L103-1 assume !(0 != main_~p7~0#1); 29507#L107-1 assume !(0 != main_~p8~0#1); 29504#L111-1 assume !(0 != main_~p9~0#1); 29501#L115-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 29499#L119-1 assume !(0 != main_~p11~0#1); 29497#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 29495#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 29491#L131-1 assume !(0 != main_~p1~0#1); 29493#L137-1 assume !(0 != main_~p2~0#1); 29482#L142-1 assume !(0 != main_~p3~0#1); 29481#L147-1 assume !(0 != main_~p4~0#1); 29470#L152-1 assume !(0 != main_~p5~0#1); 29471#L157-1 assume !(0 != main_~p6~0#1); 29453#L162-1 assume !(0 != main_~p7~0#1); 29455#L167-1 assume !(0 != main_~p8~0#1); 29538#L172-1 assume !(0 != main_~p9~0#1); 29537#L177-1 assume !(0 != main_~p10~0#1); 29535#L182-1 assume !(0 != main_~p11~0#1); 29532#L187-1 assume !(0 != main_~p12~0#1); 29531#L192-1 assume !(0 != main_~p13~0#1); 28907#L197-1 [2024-11-13 16:25:45,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-13 16:25:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108809750] [2024-11-13 16:25:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:45,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:45,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1558881611, now seen corresponding path program 1 times [2024-11-13 16:25:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:45,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631745654] [2024-11-13 16:25:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631745654] [2024-11-13 16:25:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631745654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:45,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216495728] [2024-11-13 16:25:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:45,281 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:45,282 INFO L87 Difference]: Start difference. First operand 9474 states and 14082 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:45,365 INFO L93 Difference]: Finished difference Result 18690 states and 27394 transitions. [2024-11-13 16:25:45,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18690 states and 27394 transitions. [2024-11-13 16:25:45,493 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2024-11-13 16:25:45,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18690 states to 18690 states and 27394 transitions. [2024-11-13 16:25:45,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18690 [2024-11-13 16:25:45,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18690 [2024-11-13 16:25:45,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18690 states and 27394 transitions. [2024-11-13 16:25:45,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:45,636 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2024-11-13 16:25:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states and 27394 transitions. [2024-11-13 16:25:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 18690. [2024-11-13 16:25:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18690 states, 18690 states have (on average 1.4657035848047084) internal successors, (27394), 18689 states have internal predecessors, (27394), 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) [2024-11-13 16:25:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18690 states to 18690 states and 27394 transitions. [2024-11-13 16:25:46,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2024-11-13 16:25:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:46,203 INFO L424 stractBuchiCegarLoop]: Abstraction has 18690 states and 27394 transitions. [2024-11-13 16:25:46,204 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 16:25:46,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18690 states and 27394 transitions. [2024-11-13 16:25:46,280 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 18688 [2024-11-13 16:25:46,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:46,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:46,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:46,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:46,281 INFO L745 eck$LassoCheckResult]: Stem: 57125#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 57076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 57077#L197-1 [2024-11-13 16:25:46,281 INFO L747 eck$LassoCheckResult]: Loop: 57077#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 57241#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 57237#L83 assume !(0 != main_~p1~0#1); 57234#L83-2 assume !(0 != main_~p2~0#1); 57231#L87-1 assume !(0 != main_~p3~0#1); 57227#L91-1 assume !(0 != main_~p4~0#1); 57223#L95-1 assume !(0 != main_~p5~0#1); 57219#L99-1 assume !(0 != main_~p6~0#1); 57214#L103-1 assume !(0 != main_~p7~0#1); 57210#L107-1 assume !(0 != main_~p8~0#1); 57183#L111-1 assume !(0 != main_~p9~0#1); 57185#L115-1 assume !(0 != main_~p10~0#1); 57623#L119-1 assume !(0 != main_~p11~0#1); 57639#L123-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 57636#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 57600#L131-1 assume !(0 != main_~p1~0#1); 57597#L137-1 assume !(0 != main_~p2~0#1); 57555#L142-1 assume !(0 != main_~p3~0#1); 57475#L147-1 assume !(0 != main_~p4~0#1); 57472#L152-1 assume !(0 != main_~p5~0#1); 57469#L157-1 assume !(0 != main_~p6~0#1); 57466#L162-1 assume !(0 != main_~p7~0#1); 57464#L167-1 assume !(0 != main_~p8~0#1); 57461#L172-1 assume !(0 != main_~p9~0#1); 57456#L177-1 assume !(0 != main_~p10~0#1); 57453#L182-1 assume !(0 != main_~p11~0#1); 57247#L187-1 assume !(0 != main_~p12~0#1); 57246#L192-1 assume !(0 != main_~p13~0#1); 57077#L197-1 [2024-11-13 16:25:46,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-13 16:25:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273622857] [2024-11-13 16:25:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:46,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:46,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1147737783, now seen corresponding path program 1 times [2024-11-13 16:25:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546633459] [2024-11-13 16:25:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:46,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:46,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546633459] [2024-11-13 16:25:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546633459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:46,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:25:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604306453] [2024-11-13 16:25:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:46,334 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:46,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:46,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:46,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:46,335 INFO L87 Difference]: Start difference. First operand 18690 states and 27394 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:46,450 INFO L93 Difference]: Finished difference Result 36866 states and 53250 transitions. [2024-11-13 16:25:46,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36866 states and 53250 transitions. [2024-11-13 16:25:46,713 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2024-11-13 16:25:46,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36866 states to 36866 states and 53250 transitions. [2024-11-13 16:25:46,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36866 [2024-11-13 16:25:46,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36866 [2024-11-13 16:25:46,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36866 states and 53250 transitions. [2024-11-13 16:25:47,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:47,003 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2024-11-13 16:25:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36866 states and 53250 transitions. [2024-11-13 16:25:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36866 to 36866. [2024-11-13 16:25:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36866 states, 36866 states have (on average 1.4444203330982477) internal successors, (53250), 36865 states have internal predecessors, (53250), 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) [2024-11-13 16:25:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36866 states to 36866 states and 53250 transitions. [2024-11-13 16:25:47,970 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2024-11-13 16:25:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:47,971 INFO L424 stractBuchiCegarLoop]: Abstraction has 36866 states and 53250 transitions. [2024-11-13 16:25:47,971 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 16:25:47,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36866 states and 53250 transitions. [2024-11-13 16:25:48,067 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 36864 [2024-11-13 16:25:48,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:48,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:48,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:48,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:48,068 INFO L745 eck$LassoCheckResult]: Stem: 112687#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 112638#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 112639#L197-1 [2024-11-13 16:25:48,069 INFO L747 eck$LassoCheckResult]: Loop: 112639#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 112883#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 112879#L83 assume !(0 != main_~p1~0#1); 112875#L83-2 assume !(0 != main_~p2~0#1); 112873#L87-1 assume !(0 != main_~p3~0#1); 112869#L91-1 assume !(0 != main_~p4~0#1); 112865#L95-1 assume !(0 != main_~p5~0#1); 112861#L99-1 assume !(0 != main_~p6~0#1); 112854#L103-1 assume !(0 != main_~p7~0#1); 112852#L107-1 assume !(0 != main_~p8~0#1); 112853#L111-1 assume !(0 != main_~p9~0#1); 112938#L115-1 assume !(0 != main_~p10~0#1); 112936#L119-1 assume !(0 != main_~p11~0#1); 112934#L123-1 assume !(0 != main_~p12~0#1); 112932#L127-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 112928#L131-1 assume !(0 != main_~p1~0#1); 112924#L137-1 assume !(0 != main_~p2~0#1); 112921#L142-1 assume !(0 != main_~p3~0#1); 112916#L147-1 assume !(0 != main_~p4~0#1); 112912#L152-1 assume !(0 != main_~p5~0#1); 112908#L157-1 assume !(0 != main_~p6~0#1); 112904#L162-1 assume !(0 != main_~p7~0#1); 112900#L167-1 assume !(0 != main_~p8~0#1); 112896#L172-1 assume !(0 != main_~p9~0#1); 112827#L177-1 assume !(0 != main_~p10~0#1); 112823#L182-1 assume !(0 != main_~p11~0#1); 112822#L187-1 assume !(0 != main_~p12~0#1); 112887#L192-1 assume !(0 != main_~p13~0#1); 112639#L197-1 [2024-11-13 16:25:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-13 16:25:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656612008] [2024-11-13 16:25:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:48,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:48,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:48,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash -132125895, now seen corresponding path program 1 times [2024-11-13 16:25:48,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:48,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200568196] [2024-11-13 16:25:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:25:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:25:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:25:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200568196] [2024-11-13 16:25:48,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200568196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:25:48,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:25:48,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:25:48,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221878994] [2024-11-13 16:25:48,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:25:48,120 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:25:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:25:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:25:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:25:48,120 INFO L87 Difference]: Start difference. First operand 36866 states and 53250 transitions. cyclomatic complexity: 17408 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2024-11-13 16:25:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:25:48,304 INFO L93 Difference]: Finished difference Result 72706 states and 103426 transitions. [2024-11-13 16:25:48,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72706 states and 103426 transitions. [2024-11-13 16:25:48,796 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2024-11-13 16:25:49,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72706 states to 72706 states and 103426 transitions. [2024-11-13 16:25:49,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72706 [2024-11-13 16:25:49,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72706 [2024-11-13 16:25:49,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72706 states and 103426 transitions. [2024-11-13 16:25:49,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:25:49,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2024-11-13 16:25:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72706 states and 103426 transitions. [2024-11-13 16:25:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72706 to 72706. [2024-11-13 16:25:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72706 states, 72706 states have (on average 1.4225235881495337) internal successors, (103426), 72705 states have internal predecessors, (103426), 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) [2024-11-13 16:25:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72706 states to 72706 states and 103426 transitions. [2024-11-13 16:25:50,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2024-11-13 16:25:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:25:50,492 INFO L424 stractBuchiCegarLoop]: Abstraction has 72706 states and 103426 transitions. [2024-11-13 16:25:50,492 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 16:25:50,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72706 states and 103426 transitions. [2024-11-13 16:25:50,985 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 72704 [2024-11-13 16:25:50,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:25:50,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:25:50,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:25:50,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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] [2024-11-13 16:25:50,986 INFO L745 eck$LassoCheckResult]: Stem: 222263#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 222216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_~cond~0#1; 222217#L197-1 [2024-11-13 16:25:50,986 INFO L747 eck$LassoCheckResult]: Loop: 222217#L197-1 assume !false;havoc main_#t~nondet17#1;main_~cond~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; 222914#L52 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0; 222915#L83 assume !(0 != main_~p1~0#1); 222908#L83-2 assume !(0 != main_~p2~0#1); 222910#L87-1 assume !(0 != main_~p3~0#1); 222903#L91-1 assume !(0 != main_~p4~0#1); 222905#L95-1 assume !(0 != main_~p5~0#1); 222967#L99-1 assume !(0 != main_~p6~0#1); 222963#L103-1 assume !(0 != main_~p7~0#1); 222959#L107-1 assume !(0 != main_~p8~0#1); 222956#L111-1 assume !(0 != main_~p9~0#1); 222957#L115-1 assume !(0 != main_~p10~0#1); 222762#L119-1 assume !(0 != main_~p11~0#1); 222763#L123-1 assume !(0 != main_~p12~0#1); 222746#L127-1 assume !(0 != main_~p13~0#1); 222748#L131-1 assume !(0 != main_~p1~0#1); 223177#L137-1 assume !(0 != main_~p2~0#1); 224205#L142-1 assume !(0 != main_~p3~0#1); 222437#L147-1 assume !(0 != main_~p4~0#1); 222439#L152-1 assume !(0 != main_~p5~0#1); 222854#L157-1 assume !(0 != main_~p6~0#1); 222855#L162-1 assume !(0 != main_~p7~0#1); 222843#L167-1 assume !(0 != main_~p8~0#1); 222844#L172-1 assume !(0 != main_~p9~0#1); 222929#L177-1 assume !(0 != main_~p10~0#1); 222925#L182-1 assume !(0 != main_~p11~0#1); 222924#L187-1 assume !(0 != main_~p12~0#1); 222918#L192-1 assume !(0 != main_~p13~0#1); 222217#L197-1 [2024-11-13 16:25:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-11-13 16:25:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075197929] [2024-11-13 16:25:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:50,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:50,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:51,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1143243145, now seen corresponding path program 1 times [2024-11-13 16:25:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397597732] [2024-11-13 16:25:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:51,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:51,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:51,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:25:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -99341511, now seen corresponding path program 1 times [2024-11-13 16:25:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:25:51,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658831183] [2024-11-13 16:25:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:25:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:25:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:51,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:51,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:25:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:51,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:25:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:25:51,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 04:25:51 BoogieIcfgContainer [2024-11-13 16:25:51,938 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 16:25:51,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:25:51,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:25:51,939 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:25:51,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:25:42" (3/4) ... [2024-11-13 16:25:51,942 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 16:25:51,982 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:25:51,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:25:51,984 INFO L158 Benchmark]: Toolchain (without parser) took 10436.54ms. Allocated memory was 117.4MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 94.4MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 640.6MB. Max. memory is 16.1GB. [2024-11-13 16:25:51,984 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:25:51,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.06ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 82.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:25:51,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.35ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:25:51,985 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:25:51,985 INFO L158 Benchmark]: RCFGBuilder took 488.87ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 64.3MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:25:51,986 INFO L158 Benchmark]: BuchiAutomizer took 9466.17ms. Allocated memory was 117.4MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 64.3MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 623.8MB. Max. memory is 16.1GB. [2024-11-13 16:25:51,986 INFO L158 Benchmark]: Witness Printer took 43.66ms. Allocated memory is still 6.6GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:25:51,988 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.06ms. Allocated memory is still 117.4MB. Free memory was 94.1MB in the beginning and 82.7MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.35ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 79.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 488.87ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 64.3MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9466.17ms. Allocated memory was 117.4MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 64.3MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 623.8MB. Max. memory is 16.1GB. * Witness Printer took 43.66ms. Allocated memory is still 6.6GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 72706 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 3.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 587 mSDsluCounter, 1840 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 708 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1132 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 50]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 50]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L48] int cond; Loop: [L50] COND TRUE 1 [L51] cond = __VERIFIER_nondet_int() [L52] COND FALSE !(cond == 0) [L55] lk1 = 0 [L57] lk2 = 0 [L59] lk3 = 0 [L61] lk4 = 0 [L63] lk5 = 0 [L65] lk6 = 0 [L67] lk7 = 0 [L69] lk8 = 0 [L71] lk9 = 0 [L73] lk10 = 0 [L75] lk11 = 0 [L77] lk12 = 0 [L79] lk13 = 0 [L83] COND FALSE !(p1 != 0) [L87] COND FALSE !(p2 != 0) [L91] COND FALSE !(p3 != 0) [L95] COND FALSE !(p4 != 0) [L99] COND FALSE !(p5 != 0) [L103] COND FALSE !(p6 != 0) [L107] COND FALSE !(p7 != 0) [L111] COND FALSE !(p8 != 0) [L115] COND FALSE !(p9 != 0) [L119] COND FALSE !(p10 != 0) [L123] COND FALSE !(p11 != 0) [L127] COND FALSE !(p12 != 0) [L131] COND FALSE !(p13 != 0) [L137] COND FALSE !(p1 != 0) [L142] COND FALSE !(p2 != 0) [L147] COND FALSE !(p3 != 0) [L152] COND FALSE !(p4 != 0) [L157] COND FALSE !(p5 != 0) [L162] COND FALSE !(p6 != 0) [L167] COND FALSE !(p7 != 0) [L172] COND FALSE !(p8 != 0) [L177] COND FALSE !(p9 != 0) [L182] COND FALSE !(p10 != 0) [L187] COND FALSE !(p11 != 0) [L192] COND FALSE !(p12 != 0) [L197] COND FALSE !(p13 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 16:25:52,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e12588ba-3ff0-434f-bb9e-335593b0f8bb/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)