./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya --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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:36:21,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:36:21,605 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 06:36:21,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:36:21,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:36:21,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:36:21,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:36:21,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:36:21,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:36:21,635 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:36:21,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:36:21,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:36:21,637 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:36:21,637 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 06:36:21,638 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 06:36:21,638 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 06:36:21,639 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 06:36:21,639 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 06:36:21,640 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 06:36:21,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:36:21,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 06:36:21,641 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:36:21,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:36:21,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:36:21,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:36:21,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 06:36:21,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 06:36:21,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 06:36:21,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:36:21,644 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:36:21,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:36:21,645 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 06:36:21,645 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:36:21,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:36:21,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:36:21,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:36:21,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:36:21,646 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 06:36:21,647 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2023-11-29 06:36:21,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:36:21,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:36:21,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:36:21,898 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:36:21,898 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:36:21,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/locks/test_locks_15-2.c [2023-11-29 06:36:24,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:36:24,884 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:36:24,885 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/sv-benchmarks/c/locks/test_locks_15-2.c [2023-11-29 06:36:24,892 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/data/d594a8a3e/124445baebed44e79377c626b8979c31/FLAG11572b063 [2023-11-29 06:36:25,273 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/data/d594a8a3e/124445baebed44e79377c626b8979c31 [2023-11-29 06:36:25,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:36:25,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:36:25,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:36:25,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:36:25,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:36:25,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480c92f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25, skipping insertion in model container [2023-11-29 06:36:25,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,308 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:36:25,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:36:25,472 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:36:25,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:36:25,516 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:36:25,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25 WrapperNode [2023-11-29 06:36:25,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:36:25,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:36:25,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:36:25,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:36:25,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,556 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 193 [2023-11-29 06:36:25,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:36:25,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:36:25,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:36:25,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:36:25,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,582 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]. [2023-11-29 06:36:25,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:36:25,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:36:25,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:36:25,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:36:25,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (1/1) ... [2023-11-29 06:36:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:36:25,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:36:25,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:36:25,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 06:36:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:36:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:36:25,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:36:25,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:36:25,763 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:36:25,766 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:36:26,010 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:36:26,020 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:36:26,021 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:36:26,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:36:26 BoogieIcfgContainer [2023-11-29 06:36:26,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:36:26,024 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 06:36:26,024 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 06:36:26,028 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 06:36:26,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:36:26,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 06:36:25" (1/3) ... [2023-11-29 06:36:26,031 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ec2d543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:36:26, skipping insertion in model container [2023-11-29 06:36:26,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:36:26,031 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:36:25" (2/3) ... [2023-11-29 06:36:26,031 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ec2d543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:36:26, skipping insertion in model container [2023-11-29 06:36:26,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:36:26,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:36:26" (3/3) ... [2023-11-29 06:36:26,033 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2023-11-29 06:36:26,090 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 06:36:26,090 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 06:36:26,091 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 06:36:26,091 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 06:36:26,091 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 06:36:26,091 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 06:36:26,091 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 06:36:26,091 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 06:36:26,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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) [2023-11-29 06:36:26,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2023-11-29 06:36:26,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:26,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:26,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:26,123 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, 1, 1, 1, 1] [2023-11-29 06:36:26,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 06:36:26,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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) [2023-11-29 06:36:26,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2023-11-29 06:36:26,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:26,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:26,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:26,130 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, 1, 1, 1, 1] [2023-11-29 06:36:26,138 INFO L748 eck$LassoCheckResult]: Stem: 24#$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(18, 2);call #Ultimate.allocInit(12, 3); 33#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 19#L225-1true [2023-11-29 06:36:26,139 INFO L750 eck$LassoCheckResult]: Loop: 19#L225-1true assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 25#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L97-1true assume !(0 != main_~p3~0#1); 15#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 51#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 44#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 39#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 46#L155-1true assume !(0 != main_~p2~0#1); 27#L160-1true assume !(0 != main_~p3~0#1); 10#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 45#L175-1true assume !(0 != main_~p6~0#1); 17#L180-1true assume !(0 != main_~p7~0#1); 38#L185-1true assume !(0 != main_~p8~0#1); 23#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 14#L200-1true assume !(0 != main_~p11~0#1); 43#L205-1true assume !(0 != main_~p12~0#1); 22#L210-1true assume !(0 != main_~p13~0#1); 4#L215-1true assume !(0 != main_~p14~0#1); 36#L220-1true assume !(0 != main_~p15~0#1); 19#L225-1true [2023-11-29 06:36:26,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 06:36:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989695211] [2023-11-29 06:36:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:26,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2023-11-29 06:36:26,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770249133] [2023-11-29 06:36:26,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770249133] [2023-11-29 06:36:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770249133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277996552] [2023-11-29 06:36:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:26,401 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:26,437 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:26,477 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2023-11-29 06:36:26,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 189 transitions. [2023-11-29 06:36:26,483 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2023-11-29 06:36:26,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 153 transitions. [2023-11-29 06:36:26,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2023-11-29 06:36:26,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2023-11-29 06:36:26,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2023-11-29 06:36:26,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:26,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2023-11-29 06:36:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2023-11-29 06:36:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-29 06:36:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 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) [2023-11-29 06:36:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2023-11-29 06:36:26,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2023-11-29 06:36:26,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:26,531 INFO L428 stractBuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2023-11-29 06:36:26,531 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 06:36:26,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2023-11-29 06:36:26,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2023-11-29 06:36:26,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:26,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:26,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:26,534 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, 1, 1, 1, 1] [2023-11-29 06:36:26,535 INFO L748 eck$LassoCheckResult]: Stem: 204#$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(18, 2);call #Ultimate.allocInit(12, 3); 205#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 211#L225-1 [2023-11-29 06:36:26,535 INFO L750 eck$LassoCheckResult]: Loop: 211#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 222#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 221#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 184#L97-1 assume !(0 != main_~p3~0#1); 185#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 217#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 256#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 191#L129-1 assume !(0 != main_~p11~0#1); 212#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 254#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 253#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 252#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 251#L149-1 assume !(0 != main_~p1~0#1); 250#L155-1 assume !(0 != main_~p2~0#1); 248#L160-1 assume !(0 != main_~p3~0#1); 246#L165-1 assume !(0 != main_~p4~0#1); 243#L170-1 assume !(0 != main_~p5~0#1); 242#L175-1 assume !(0 != main_~p6~0#1); 240#L180-1 assume !(0 != main_~p7~0#1); 237#L185-1 assume !(0 != main_~p8~0#1); 236#L190-1 assume !(0 != main_~p9~0#1); 234#L195-1 assume !(0 != main_~p10~0#1); 232#L200-1 assume !(0 != main_~p11~0#1); 230#L205-1 assume !(0 != main_~p12~0#1); 228#L210-1 assume !(0 != main_~p13~0#1); 226#L215-1 assume !(0 != main_~p14~0#1); 224#L220-1 assume !(0 != main_~p15~0#1); 211#L225-1 [2023-11-29 06:36:26,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-29 06:36:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661086351] [2023-11-29 06:36:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:26,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2023-11-29 06:36:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869442338] [2023-11-29 06:36:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869442338] [2023-11-29 06:36:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869442338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265598381] [2023-11-29 06:36:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:26,616 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:26,617 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:26,639 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2023-11-29 06:36:26,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2023-11-29 06:36:26,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2023-11-29 06:36:26,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2023-11-29 06:36:26,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2023-11-29 06:36:26,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2023-11-29 06:36:26,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2023-11-29 06:36:26,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:26,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2023-11-29 06:36:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2023-11-29 06:36:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-11-29 06:36:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 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) [2023-11-29 06:36:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2023-11-29 06:36:26,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2023-11-29 06:36:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:26,665 INFO L428 stractBuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2023-11-29 06:36:26,665 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 06:36:26,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2023-11-29 06:36:26,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2023-11-29 06:36:26,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:26,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:26,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:26,669 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, 1, 1, 1, 1] [2023-11-29 06:36:26,669 INFO L748 eck$LassoCheckResult]: Stem: 491#$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(18, 2);call #Ultimate.allocInit(12, 3); 492#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 498#L225-1 [2023-11-29 06:36:26,670 INFO L750 eck$LassoCheckResult]: Loop: 498#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 516#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 512#L93 assume !(0 != main_~p1~0#1); 513#L93-2 assume !(0 != main_~p2~0#1); 639#L97-1 assume !(0 != main_~p3~0#1); 638#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 637#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 636#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 635#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 634#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 633#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 632#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 499#L129-1 assume !(0 != main_~p11~0#1); 500#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 527#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 528#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 523#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 524#L149-1 assume !(0 != main_~p1~0#1); 608#L155-1 assume !(0 != main_~p2~0#1); 606#L160-1 assume !(0 != main_~p3~0#1); 604#L165-1 assume !(0 != main_~p4~0#1); 599#L170-1 assume !(0 != main_~p5~0#1); 590#L175-1 assume !(0 != main_~p6~0#1); 582#L180-1 assume !(0 != main_~p7~0#1); 577#L185-1 assume !(0 != main_~p8~0#1); 572#L190-1 assume !(0 != main_~p9~0#1); 570#L195-1 assume !(0 != main_~p10~0#1); 564#L200-1 assume !(0 != main_~p11~0#1); 560#L205-1 assume !(0 != main_~p12~0#1); 552#L210-1 assume !(0 != main_~p13~0#1); 548#L215-1 assume !(0 != main_~p14~0#1); 546#L220-1 assume !(0 != main_~p15~0#1); 498#L225-1 [2023-11-29 06:36:26,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-29 06:36:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956708703] [2023-11-29 06:36:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:26,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2023-11-29 06:36:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347826293] [2023-11-29 06:36:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:26,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:26,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347826293] [2023-11-29 06:36:26,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347826293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:26,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:26,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016893490] [2023-11-29 06:36:26,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:26,738 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:26,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:26,739 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:26,760 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2023-11-29 06:36:26,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2023-11-29 06:36:26,763 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2023-11-29 06:36:26,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2023-11-29 06:36:26,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2023-11-29 06:36:26,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2023-11-29 06:36:26,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2023-11-29 06:36:26,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:26,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2023-11-29 06:36:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2023-11-29 06:36:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2023-11-29 06:36:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 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) [2023-11-29 06:36:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2023-11-29 06:36:26,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2023-11-29 06:36:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:26,793 INFO L428 stractBuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2023-11-29 06:36:26,793 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 06:36:26,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2023-11-29 06:36:26,796 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2023-11-29 06:36:26,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:26,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:26,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:26,797 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, 1, 1, 1, 1] [2023-11-29 06:36:26,797 INFO L748 eck$LassoCheckResult]: Stem: 1049#$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(18, 2);call #Ultimate.allocInit(12, 3); 1050#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1056#L225-1 [2023-11-29 06:36:26,798 INFO L750 eck$LassoCheckResult]: Loop: 1056#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1133#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1129#L93 assume !(0 != main_~p1~0#1); 1123#L93-2 assume !(0 != main_~p2~0#1); 1120#L97-1 assume !(0 != main_~p3~0#1); 1114#L101-1 assume !(0 != main_~p4~0#1); 1115#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1259#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1257#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1255#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1253#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1251#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1249#L129-1 assume !(0 != main_~p11~0#1); 1247#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1246#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1243#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1241#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1239#L149-1 assume !(0 != main_~p1~0#1); 1238#L155-1 assume !(0 != main_~p2~0#1); 1237#L160-1 assume !(0 != main_~p3~0#1); 1233#L165-1 assume !(0 != main_~p4~0#1); 1234#L170-1 assume !(0 != main_~p5~0#1); 1228#L175-1 assume !(0 != main_~p6~0#1); 1220#L180-1 assume !(0 != main_~p7~0#1); 1196#L185-1 assume !(0 != main_~p8~0#1); 1171#L190-1 assume !(0 != main_~p9~0#1); 1169#L195-1 assume !(0 != main_~p10~0#1); 1167#L200-1 assume !(0 != main_~p11~0#1); 1165#L205-1 assume !(0 != main_~p12~0#1); 1163#L210-1 assume !(0 != main_~p13~0#1); 1147#L215-1 assume !(0 != main_~p14~0#1); 1143#L220-1 assume !(0 != main_~p15~0#1); 1056#L225-1 [2023-11-29 06:36:26,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-29 06:36:26,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013046334] [2023-11-29 06:36:26,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:26,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2023-11-29 06:36:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254674961] [2023-11-29 06:36:26,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:26,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254674961] [2023-11-29 06:36:26,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254674961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:26,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063779239] [2023-11-29 06:36:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:26,846 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:26,847 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:26,864 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2023-11-29 06:36:26,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2023-11-29 06:36:26,871 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2023-11-29 06:36:26,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2023-11-29 06:36:26,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2023-11-29 06:36:26,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2023-11-29 06:36:26,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2023-11-29 06:36:26,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:26,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2023-11-29 06:36:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2023-11-29 06:36:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2023-11-29 06:36:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 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) [2023-11-29 06:36:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2023-11-29 06:36:26,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2023-11-29 06:36:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:26,912 INFO L428 stractBuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2023-11-29 06:36:26,912 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 06:36:26,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2023-11-29 06:36:26,917 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2023-11-29 06:36:26,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:26,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:26,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:26,918 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, 1, 1, 1, 1] [2023-11-29 06:36:26,919 INFO L748 eck$LassoCheckResult]: Stem: 2146#$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(18, 2);call #Ultimate.allocInit(12, 3); 2147#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2113#L225-1 [2023-11-29 06:36:26,919 INFO L750 eck$LassoCheckResult]: Loop: 2113#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2152#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2153#L93 assume !(0 != main_~p1~0#1); 2564#L93-2 assume !(0 != main_~p2~0#1); 2558#L97-1 assume !(0 != main_~p3~0#1); 2526#L101-1 assume !(0 != main_~p4~0#1); 2528#L105-1 assume !(0 != main_~p5~0#1); 2556#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2554#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2552#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2550#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2548#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2546#L129-1 assume !(0 != main_~p11~0#1); 2544#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2542#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2540#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2538#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2536#L149-1 assume !(0 != main_~p1~0#1); 2490#L155-1 assume !(0 != main_~p2~0#1); 2491#L160-1 assume !(0 != main_~p3~0#1); 2623#L165-1 assume !(0 != main_~p4~0#1); 2482#L170-1 assume !(0 != main_~p5~0#1); 2479#L175-1 assume !(0 != main_~p6~0#1); 2478#L180-1 assume !(0 != main_~p7~0#1); 2158#L185-1 assume !(0 != main_~p8~0#1); 2117#L190-1 assume !(0 != main_~p9~0#1); 2628#L195-1 assume !(0 != main_~p10~0#1); 2124#L200-1 assume !(0 != main_~p11~0#1); 2125#L205-1 assume !(0 != main_~p12~0#1); 2140#L210-1 assume !(0 != main_~p13~0#1); 2108#L215-1 assume !(0 != main_~p14~0#1); 2109#L220-1 assume !(0 != main_~p15~0#1); 2113#L225-1 [2023-11-29 06:36:26,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,919 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-29 06:36:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846366530] [2023-11-29 06:36:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:26,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:26,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2023-11-29 06:36:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221100638] [2023-11-29 06:36:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221100638] [2023-11-29 06:36:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221100638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:26,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027414300] [2023-11-29 06:36:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:26,963 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:26,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:26,964 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:26,982 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2023-11-29 06:36:26,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2023-11-29 06:36:26,996 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2023-11-29 06:36:27,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2023-11-29 06:36:27,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2023-11-29 06:36:27,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2023-11-29 06:36:27,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2023-11-29 06:36:27,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:27,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2023-11-29 06:36:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2023-11-29 06:36:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2023-11-29 06:36:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 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) [2023-11-29 06:36:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2023-11-29 06:36:27,051 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2023-11-29 06:36:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:27,052 INFO L428 stractBuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2023-11-29 06:36:27,052 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 06:36:27,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2023-11-29 06:36:27,062 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2023-11-29 06:36:27,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:27,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:27,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:27,063 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, 1, 1, 1, 1] [2023-11-29 06:36:27,063 INFO L748 eck$LassoCheckResult]: Stem: 4300#$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(18, 2);call #Ultimate.allocInit(12, 3); 4301#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4307#L225-1 [2023-11-29 06:36:27,063 INFO L750 eck$LassoCheckResult]: Loop: 4307#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4522#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4523#L93 assume !(0 != main_~p1~0#1); 4733#L93-2 assume !(0 != main_~p2~0#1); 4732#L97-1 assume !(0 != main_~p3~0#1); 4730#L101-1 assume !(0 != main_~p4~0#1); 4727#L105-1 assume !(0 != main_~p5~0#1); 4723#L109-1 assume !(0 != main_~p6~0#1); 4721#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4719#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4717#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4715#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4713#L129-1 assume !(0 != main_~p11~0#1); 4711#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4709#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4707#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4705#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4702#L149-1 assume !(0 != main_~p1~0#1); 4703#L155-1 assume !(0 != main_~p2~0#1); 4752#L160-1 assume !(0 != main_~p3~0#1); 4651#L165-1 assume !(0 != main_~p4~0#1); 4652#L170-1 assume !(0 != main_~p5~0#1); 4639#L175-1 assume !(0 != main_~p6~0#1); 4641#L180-1 assume !(0 != main_~p7~0#1); 4625#L185-1 assume !(0 != main_~p8~0#1); 4626#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4596#L205-1 assume !(0 != main_~p12~0#1); 4588#L210-1 assume !(0 != main_~p13~0#1); 4587#L215-1 assume !(0 != main_~p14~0#1); 4543#L220-1 assume !(0 != main_~p15~0#1); 4307#L225-1 [2023-11-29 06:36:27,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-29 06:36:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184227623] [2023-11-29 06:36:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:27,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:27,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:27,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2023-11-29 06:36:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965744850] [2023-11-29 06:36:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:27,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965744850] [2023-11-29 06:36:27,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965744850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:27,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366915297] [2023-11-29 06:36:27,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:27,108 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:27,109 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:27,132 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2023-11-29 06:36:27,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2023-11-29 06:36:27,158 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2023-11-29 06:36:27,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2023-11-29 06:36:27,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2023-11-29 06:36:27,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2023-11-29 06:36:27,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2023-11-29 06:36:27,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:27,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2023-11-29 06:36:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2023-11-29 06:36:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2023-11-29 06:36:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 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) [2023-11-29 06:36:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2023-11-29 06:36:27,228 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2023-11-29 06:36:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:27,229 INFO L428 stractBuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2023-11-29 06:36:27,229 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 06:36:27,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2023-11-29 06:36:27,244 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2023-11-29 06:36:27,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:27,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:27,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:27,245 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, 1, 1, 1, 1] [2023-11-29 06:36:27,245 INFO L748 eck$LassoCheckResult]: Stem: 8551#$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(18, 2);call #Ultimate.allocInit(12, 3); 8552#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2023-11-29 06:36:27,246 INFO L750 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8715#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8713#L93 assume !(0 != main_~p1~0#1); 8712#L93-2 assume !(0 != main_~p2~0#1); 8706#L97-1 assume !(0 != main_~p3~0#1); 8707#L101-1 assume !(0 != main_~p4~0#1); 8813#L105-1 assume !(0 != main_~p5~0#1); 8810#L109-1 assume !(0 != main_~p6~0#1); 8806#L113-1 assume !(0 != main_~p7~0#1); 8804#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8803#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8800#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8797#L129-1 assume !(0 != main_~p11~0#1); 8794#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8790#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8786#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8781#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8775#L149-1 assume !(0 != main_~p1~0#1); 8769#L155-1 assume !(0 != main_~p2~0#1); 8764#L160-1 assume !(0 != main_~p3~0#1); 8757#L165-1 assume !(0 != main_~p4~0#1); 8751#L170-1 assume !(0 != main_~p5~0#1); 8746#L175-1 assume !(0 != main_~p6~0#1); 8744#L180-1 assume !(0 != main_~p7~0#1); 8738#L185-1 assume !(0 != main_~p8~0#1); 8735#L190-1 assume !(0 != main_~p9~0#1); 8731#L195-1 assume !(0 != main_~p10~0#1); 8725#L200-1 assume !(0 != main_~p11~0#1); 8723#L205-1 assume !(0 != main_~p12~0#1); 8721#L210-1 assume !(0 != main_~p13~0#1); 8719#L215-1 assume !(0 != main_~p14~0#1); 8717#L220-1 assume !(0 != main_~p15~0#1); 8558#L225-1 [2023-11-29 06:36:27,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-29 06:36:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:27,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874610948] [2023-11-29 06:36:27,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:27,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:27,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:27,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:27,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2023-11-29 06:36:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109565873] [2023-11-29 06:36:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:27,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109565873] [2023-11-29 06:36:27,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109565873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809827446] [2023-11-29 06:36:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:27,282 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:27,283 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:27,315 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2023-11-29 06:36:27,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2023-11-29 06:36:27,354 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2023-11-29 06:36:27,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2023-11-29 06:36:27,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2023-11-29 06:36:27,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2023-11-29 06:36:27,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2023-11-29 06:36:27,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:27,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2023-11-29 06:36:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2023-11-29 06:36:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2023-11-29 06:36:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 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) [2023-11-29 06:36:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2023-11-29 06:36:27,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2023-11-29 06:36:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:27,514 INFO L428 stractBuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2023-11-29 06:36:27,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 06:36:27,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2023-11-29 06:36:27,534 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2023-11-29 06:36:27,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:27,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:27,534 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:27,535 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, 1, 1, 1, 1] [2023-11-29 06:36:27,535 INFO L748 eck$LassoCheckResult]: Stem: 16942#$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(18, 2);call #Ultimate.allocInit(12, 3); 16943#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2023-11-29 06:36:27,535 INFO L750 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17204#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17198#L93 assume !(0 != main_~p1~0#1); 17194#L93-2 assume !(0 != main_~p2~0#1); 17191#L97-1 assume !(0 != main_~p3~0#1); 17185#L101-1 assume !(0 != main_~p4~0#1); 17179#L105-1 assume !(0 != main_~p5~0#1); 17175#L109-1 assume !(0 != main_~p6~0#1); 17170#L113-1 assume !(0 != main_~p7~0#1); 17164#L117-1 assume !(0 != main_~p8~0#1); 17165#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17152#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17153#L129-1 assume !(0 != main_~p11~0#1); 17144#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17145#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17136#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17137#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17126#L149-1 assume !(0 != main_~p1~0#1); 17127#L155-1 assume !(0 != main_~p2~0#1); 17116#L160-1 assume !(0 != main_~p3~0#1); 17115#L165-1 assume !(0 != main_~p4~0#1); 17102#L170-1 assume !(0 != main_~p5~0#1); 17103#L175-1 assume !(0 != main_~p6~0#1); 17093#L180-1 assume !(0 != main_~p7~0#1); 17094#L185-1 assume !(0 != main_~p8~0#1); 17246#L190-1 assume !(0 != main_~p9~0#1); 17242#L195-1 assume !(0 != main_~p10~0#1); 17238#L200-1 assume !(0 != main_~p11~0#1); 17232#L205-1 assume !(0 != main_~p12~0#1); 17226#L210-1 assume !(0 != main_~p13~0#1); 17220#L215-1 assume !(0 != main_~p14~0#1); 17214#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2023-11-29 06:36:27,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-29 06:36:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:27,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692496966] [2023-11-29 06:36:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:27,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:27,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:27,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:27,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2023-11-29 06:36:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:27,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124149455] [2023-11-29 06:36:27,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:27,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124149455] [2023-11-29 06:36:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124149455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:27,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440174726] [2023-11-29 06:36:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:27,571 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:27,572 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:27,634 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2023-11-29 06:36:27,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2023-11-29 06:36:27,701 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2023-11-29 06:36:27,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2023-11-29 06:36:27,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2023-11-29 06:36:27,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2023-11-29 06:36:27,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2023-11-29 06:36:27,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:27,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2023-11-29 06:36:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2023-11-29 06:36:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2023-11-29 06:36:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 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) [2023-11-29 06:36:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2023-11-29 06:36:28,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2023-11-29 06:36:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:28,094 INFO L428 stractBuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2023-11-29 06:36:28,094 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 06:36:28,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2023-11-29 06:36:28,126 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2023-11-29 06:36:28,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:28,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:28,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:28,127 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, 1, 1, 1, 1] [2023-11-29 06:36:28,127 INFO L748 eck$LassoCheckResult]: Stem: 33526#$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(18, 2);call #Ultimate.allocInit(12, 3); 33527#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33531#L225-1 [2023-11-29 06:36:28,127 INFO L750 eck$LassoCheckResult]: Loop: 33531#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33939#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33933#L93 assume !(0 != main_~p1~0#1); 33809#L93-2 assume !(0 != main_~p2~0#1); 33799#L97-1 assume !(0 != main_~p3~0#1); 33791#L101-1 assume !(0 != main_~p4~0#1); 33780#L105-1 assume !(0 != main_~p5~0#1); 33770#L109-1 assume !(0 != main_~p6~0#1); 33763#L113-1 assume !(0 != main_~p7~0#1); 33759#L117-1 assume !(0 != main_~p8~0#1); 33754#L121-1 assume !(0 != main_~p9~0#1); 33750#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33747#L129-1 assume !(0 != main_~p11~0#1); 33744#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33741#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33737#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33738#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33970#L149-1 assume !(0 != main_~p1~0#1); 33966#L155-1 assume !(0 != main_~p2~0#1); 33963#L160-1 assume !(0 != main_~p3~0#1); 33958#L165-1 assume !(0 != main_~p4~0#1); 33944#L170-1 assume !(0 != main_~p5~0#1); 33934#L175-1 assume !(0 != main_~p6~0#1); 33936#L180-1 assume !(0 != main_~p7~0#1); 34036#L185-1 assume !(0 != main_~p8~0#1); 34034#L190-1 assume !(0 != main_~p9~0#1); 34033#L195-1 assume !(0 != main_~p10~0#1); 34031#L200-1 assume !(0 != main_~p11~0#1); 34029#L205-1 assume !(0 != main_~p12~0#1); 34027#L210-1 assume !(0 != main_~p13~0#1); 33978#L215-1 assume !(0 != main_~p14~0#1); 33955#L220-1 assume !(0 != main_~p15~0#1); 33531#L225-1 [2023-11-29 06:36:28,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2023-11-29 06:36:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:28,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367995100] [2023-11-29 06:36:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:28,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:28,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:28,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2023-11-29 06:36:28,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069314216] [2023-11-29 06:36:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:28,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:28,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069314216] [2023-11-29 06:36:28,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069314216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:28,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622361116] [2023-11-29 06:36:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:28,164 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:28,165 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:28,229 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2023-11-29 06:36:28,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2023-11-29 06:36:28,379 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2023-11-29 06:36:28,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2023-11-29 06:36:28,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2023-11-29 06:36:28,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2023-11-29 06:36:28,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2023-11-29 06:36:28,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:28,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2023-11-29 06:36:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2023-11-29 06:36:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2023-11-29 06:36:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 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) [2023-11-29 06:36:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2023-11-29 06:36:28,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2023-11-29 06:36:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:28,894 INFO L428 stractBuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2023-11-29 06:36:28,894 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 06:36:28,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2023-11-29 06:36:28,952 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2023-11-29 06:36:28,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:28,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:28,953 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:28,953 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, 1, 1, 1, 1] [2023-11-29 06:36:28,953 INFO L748 eck$LassoCheckResult]: Stem: 66304#$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(18, 2);call #Ultimate.allocInit(12, 3); 66305#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2023-11-29 06:36:28,953 INFO L750 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66961#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66959#L93 assume !(0 != main_~p1~0#1); 66957#L93-2 assume !(0 != main_~p2~0#1); 66956#L97-1 assume !(0 != main_~p3~0#1); 66954#L101-1 assume !(0 != main_~p4~0#1); 66952#L105-1 assume !(0 != main_~p5~0#1); 66951#L109-1 assume !(0 != main_~p6~0#1); 66949#L113-1 assume !(0 != main_~p7~0#1); 66947#L117-1 assume !(0 != main_~p8~0#1); 66945#L121-1 assume !(0 != main_~p9~0#1); 66943#L125-1 assume !(0 != main_~p10~0#1); 66941#L129-1 assume !(0 != main_~p11~0#1); 66940#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66938#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66935#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66905#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66900#L149-1 assume !(0 != main_~p1~0#1); 66897#L155-1 assume !(0 != main_~p2~0#1); 66896#L160-1 assume !(0 != main_~p3~0#1); 66891#L165-1 assume !(0 != main_~p4~0#1); 66705#L170-1 assume !(0 != main_~p5~0#1); 66706#L175-1 assume !(0 != main_~p6~0#1); 66697#L180-1 assume !(0 != main_~p7~0#1); 66698#L185-1 assume !(0 != main_~p8~0#1); 66833#L190-1 assume !(0 != main_~p9~0#1); 66835#L195-1 assume !(0 != main_~p10~0#1); 66877#L200-1 assume !(0 != main_~p11~0#1); 66872#L205-1 assume !(0 != main_~p12~0#1); 66871#L210-1 assume !(0 != main_~p13~0#1); 66965#L215-1 assume !(0 != main_~p14~0#1); 66963#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2023-11-29 06:36:28,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2023-11-29 06:36:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91649548] [2023-11-29 06:36:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:28,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:28,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:28,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2023-11-29 06:36:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411951950] [2023-11-29 06:36:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:28,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411951950] [2023-11-29 06:36:28,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411951950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:28,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:28,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088560199] [2023-11-29 06:36:28,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:28,993 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:28,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:28,994 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:29,161 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2023-11-29 06:36:29,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2023-11-29 06:36:29,368 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2023-11-29 06:36:29,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2023-11-29 06:36:29,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2023-11-29 06:36:29,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2023-11-29 06:36:29,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2023-11-29 06:36:29,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:29,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2023-11-29 06:36:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2023-11-29 06:36:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2023-11-29 06:36:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 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) [2023-11-29 06:36:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2023-11-29 06:36:30,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2023-11-29 06:36:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:30,180 INFO L428 stractBuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2023-11-29 06:36:30,180 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-29 06:36:30,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2023-11-29 06:36:30,270 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2023-11-29 06:36:30,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:30,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:30,271 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:30,271 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, 1, 1, 1, 1] [2023-11-29 06:36:30,271 INFO L748 eck$LassoCheckResult]: Stem: 131083#$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(18, 2);call #Ultimate.allocInit(12, 3); 131084#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131090#L225-1 [2023-11-29 06:36:30,271 INFO L750 eck$LassoCheckResult]: Loop: 131090#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131931#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 131932#L93 assume !(0 != main_~p1~0#1); 131905#L93-2 assume !(0 != main_~p2~0#1); 131907#L97-1 assume !(0 != main_~p3~0#1); 131892#L101-1 assume !(0 != main_~p4~0#1); 131894#L105-1 assume !(0 != main_~p5~0#1); 132109#L109-1 assume !(0 != main_~p6~0#1); 132105#L113-1 assume !(0 != main_~p7~0#1); 132101#L117-1 assume !(0 != main_~p8~0#1); 132098#L121-1 assume !(0 != main_~p9~0#1); 132095#L125-1 assume !(0 != main_~p10~0#1); 132092#L129-1 assume !(0 != main_~p11~0#1); 132053#L133-1 assume !(0 != main_~p12~0#1); 132054#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 132056#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132051#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132022#L149-1 assume !(0 != main_~p1~0#1); 132023#L155-1 assume !(0 != main_~p2~0#1); 132108#L160-1 assume !(0 != main_~p3~0#1); 132103#L165-1 assume !(0 != main_~p4~0#1); 132100#L170-1 assume !(0 != main_~p5~0#1); 132097#L175-1 assume !(0 != main_~p6~0#1); 132093#L180-1 assume !(0 != main_~p7~0#1); 132091#L185-1 assume !(0 != main_~p8~0#1); 132088#L190-1 assume !(0 != main_~p9~0#1); 132086#L195-1 assume !(0 != main_~p10~0#1); 132083#L200-1 assume !(0 != main_~p11~0#1); 132081#L205-1 assume !(0 != main_~p12~0#1); 132080#L210-1 assume !(0 != main_~p13~0#1); 132078#L215-1 assume !(0 != main_~p14~0#1); 131939#L220-1 assume !(0 != main_~p15~0#1); 131090#L225-1 [2023-11-29 06:36:30,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2023-11-29 06:36:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:30,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398891201] [2023-11-29 06:36:30,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:30,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:30,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:30,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2023-11-29 06:36:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546941712] [2023-11-29 06:36:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546941712] [2023-11-29 06:36:30,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546941712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:30,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:30,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:30,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123584303] [2023-11-29 06:36:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:30,304 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:30,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:30,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:30,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:30,305 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:30,665 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2023-11-29 06:36:30,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2023-11-29 06:36:30,875 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2023-11-29 06:36:31,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2023-11-29 06:36:31,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2023-11-29 06:36:31,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2023-11-29 06:36:31,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2023-11-29 06:36:31,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:31,278 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2023-11-29 06:36:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2023-11-29 06:36:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2023-11-29 06:36:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 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) [2023-11-29 06:36:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2023-11-29 06:36:32,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2023-11-29 06:36:32,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:32,172 INFO L428 stractBuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2023-11-29 06:36:32,172 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-29 06:36:32,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2023-11-29 06:36:32,354 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2023-11-29 06:36:32,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:32,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:32,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:32,355 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, 1, 1, 1, 1] [2023-11-29 06:36:32,356 INFO L748 eck$LassoCheckResult]: Stem: 259091#$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(18, 2);call #Ultimate.allocInit(12, 3); 259092#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2023-11-29 06:36:32,356 INFO L750 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 259378#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 259376#L93 assume !(0 != main_~p1~0#1); 259374#L93-2 assume !(0 != main_~p2~0#1); 259373#L97-1 assume !(0 != main_~p3~0#1); 259371#L101-1 assume !(0 != main_~p4~0#1); 259369#L105-1 assume !(0 != main_~p5~0#1); 259367#L109-1 assume !(0 != main_~p6~0#1); 259365#L113-1 assume !(0 != main_~p7~0#1); 259363#L117-1 assume !(0 != main_~p8~0#1); 259361#L121-1 assume !(0 != main_~p9~0#1); 259238#L125-1 assume !(0 != main_~p10~0#1); 259184#L129-1 assume !(0 != main_~p11~0#1); 259185#L133-1 assume !(0 != main_~p12~0#1); 259359#L137-1 assume !(0 != main_~p13~0#1); 259356#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 259354#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 259351#L149-1 assume !(0 != main_~p1~0#1); 259347#L155-1 assume !(0 != main_~p2~0#1); 259344#L160-1 assume !(0 != main_~p3~0#1); 259339#L165-1 assume !(0 != main_~p4~0#1); 259335#L170-1 assume !(0 != main_~p5~0#1); 259330#L175-1 assume !(0 != main_~p6~0#1); 259324#L180-1 assume !(0 != main_~p7~0#1); 259319#L185-1 assume !(0 != main_~p8~0#1); 259313#L190-1 assume !(0 != main_~p9~0#1); 259307#L195-1 assume !(0 != main_~p10~0#1); 259235#L200-1 assume !(0 != main_~p11~0#1); 259234#L205-1 assume !(0 != main_~p12~0#1); 259297#L210-1 assume !(0 != main_~p13~0#1); 259382#L215-1 assume !(0 != main_~p14~0#1); 259380#L220-1 assume !(0 != main_~p15~0#1); 259099#L225-1 [2023-11-29 06:36:32,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2023-11-29 06:36:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880924492] [2023-11-29 06:36:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:32,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:32,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:32,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2023-11-29 06:36:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074532724] [2023-11-29 06:36:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:32,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074532724] [2023-11-29 06:36:32,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074532724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:32,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:36:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546320958] [2023-11-29 06:36:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:32,390 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:32,391 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:32,995 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2023-11-29 06:36:32,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2023-11-29 06:36:33,735 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2023-11-29 06:36:34,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2023-11-29 06:36:34,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2023-11-29 06:36:34,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2023-11-29 06:36:34,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2023-11-29 06:36:34,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:34,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2023-11-29 06:36:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2023-11-29 06:36:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2023-11-29 06:36:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 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) [2023-11-29 06:36:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2023-11-29 06:36:36,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2023-11-29 06:36:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:36,138 INFO L428 stractBuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2023-11-29 06:36:36,138 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-29 06:36:36,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2023-11-29 06:36:36,587 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2023-11-29 06:36:36,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:36,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:36,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:36,589 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, 1, 1, 1, 1] [2023-11-29 06:36:36,590 INFO L748 eck$LassoCheckResult]: Stem: 512033#$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(18, 2);call #Ultimate.allocInit(12, 3); 512034#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512043#L225-1 [2023-11-29 06:36:36,590 INFO L750 eck$LassoCheckResult]: Loop: 512043#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 513169#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 513166#L93 assume !(0 != main_~p1~0#1); 513160#L93-2 assume !(0 != main_~p2~0#1); 513155#L97-1 assume !(0 != main_~p3~0#1); 513152#L101-1 assume !(0 != main_~p4~0#1); 513149#L105-1 assume !(0 != main_~p5~0#1); 513141#L109-1 assume !(0 != main_~p6~0#1); 513143#L113-1 assume !(0 != main_~p7~0#1); 513131#L117-1 assume !(0 != main_~p8~0#1); 513133#L121-1 assume !(0 != main_~p9~0#1); 513121#L125-1 assume !(0 != main_~p10~0#1); 513123#L129-1 assume !(0 != main_~p11~0#1); 513114#L133-1 assume !(0 != main_~p12~0#1); 513115#L137-1 assume !(0 != main_~p13~0#1); 513091#L141-1 assume !(0 != main_~p14~0#1); 513089#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 513090#L149-1 assume !(0 != main_~p1~0#1); 513250#L155-1 assume !(0 != main_~p2~0#1); 513245#L160-1 assume !(0 != main_~p3~0#1); 513238#L165-1 assume !(0 != main_~p4~0#1); 513232#L170-1 assume !(0 != main_~p5~0#1); 513224#L175-1 assume !(0 != main_~p6~0#1); 513216#L180-1 assume !(0 != main_~p7~0#1); 513208#L185-1 assume !(0 != main_~p8~0#1); 513204#L190-1 assume !(0 != main_~p9~0#1); 513199#L195-1 assume !(0 != main_~p10~0#1); 513194#L200-1 assume !(0 != main_~p11~0#1); 513191#L205-1 assume !(0 != main_~p12~0#1); 513189#L210-1 assume !(0 != main_~p13~0#1); 513186#L215-1 assume !(0 != main_~p14~0#1); 513182#L220-1 assume !(0 != main_~p15~0#1); 512043#L225-1 [2023-11-29 06:36:36,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2023-11-29 06:36:36,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634984797] [2023-11-29 06:36:36,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:36,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:36,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:36,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2023-11-29 06:36:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:36,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2354519] [2023-11-29 06:36:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:36:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:36:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:36:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2354519] [2023-11-29 06:36:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2354519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:36:36,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:36:36,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:36:36,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102228035] [2023-11-29 06:36:36,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:36:36,629 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-29 06:36:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:36:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:36:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:36:36,630 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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) [2023-11-29 06:36:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:36:37,518 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2023-11-29 06:36:37,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2023-11-29 06:36:38,837 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2023-11-29 06:36:39,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2023-11-29 06:36:39,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2023-11-29 06:36:39,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2023-11-29 06:36:39,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2023-11-29 06:36:39,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:36:39,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2023-11-29 06:36:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2023-11-29 06:36:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2023-11-29 06:36:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 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) [2023-11-29 06:36:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2023-11-29 06:36:43,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2023-11-29 06:36:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:36:43,824 INFO L428 stractBuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2023-11-29 06:36:43,824 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-29 06:36:43,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2023-11-29 06:36:44,443 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2023-11-29 06:36:44,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:36:44,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:36:44,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:36:44,446 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, 1, 1, 1, 1] [2023-11-29 06:36:44,447 INFO L748 eck$LassoCheckResult]: Stem: 1011755#$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(18, 2);call #Ultimate.allocInit(12, 3); 1011756#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_#t~nondet18#1, main_#t~nondet19#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_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011761#L225-1 [2023-11-29 06:36:44,447 INFO L750 eck$LassoCheckResult]: Loop: 1011761#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012022#L58 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;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1012017#L93 assume !(0 != main_~p1~0#1); 1012010#L93-2 assume !(0 != main_~p2~0#1); 1012003#L97-1 assume !(0 != main_~p3~0#1); 1011997#L101-1 assume !(0 != main_~p4~0#1); 1011990#L105-1 assume !(0 != main_~p5~0#1); 1011982#L109-1 assume !(0 != main_~p6~0#1); 1011974#L113-1 assume !(0 != main_~p7~0#1); 1011964#L117-1 assume !(0 != main_~p8~0#1); 1011965#L121-1 assume !(0 != main_~p9~0#1); 1012113#L125-1 assume !(0 != main_~p10~0#1); 1012111#L129-1 assume !(0 != main_~p11~0#1); 1012107#L133-1 assume !(0 != main_~p12~0#1); 1012103#L137-1 assume !(0 != main_~p13~0#1); 1012099#L141-1 assume !(0 != main_~p14~0#1); 1012095#L145-1 assume !(0 != main_~p15~0#1); 1012091#L149-1 assume !(0 != main_~p1~0#1); 1012087#L155-1 assume !(0 != main_~p2~0#1); 1012084#L160-1 assume !(0 != main_~p3~0#1); 1012079#L165-1 assume !(0 != main_~p4~0#1); 1012075#L170-1 assume !(0 != main_~p5~0#1); 1012071#L175-1 assume !(0 != main_~p6~0#1); 1012067#L180-1 assume !(0 != main_~p7~0#1); 1012065#L185-1 assume !(0 != main_~p8~0#1); 1012062#L190-1 assume !(0 != main_~p9~0#1); 1012058#L195-1 assume !(0 != main_~p10~0#1); 1012055#L200-1 assume !(0 != main_~p11~0#1); 1012051#L205-1 assume !(0 != main_~p12~0#1); 1012046#L210-1 assume !(0 != main_~p13~0#1); 1012040#L215-1 assume !(0 != main_~p14~0#1); 1012033#L220-1 assume !(0 != main_~p15~0#1); 1011761#L225-1 [2023-11-29 06:36:44,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2023-11-29 06:36:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248288439] [2023-11-29 06:36:44,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:44,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:44,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:44,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:44,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2023-11-29 06:36:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371249209] [2023-11-29 06:36:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:44,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:44,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:44,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:36:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2023-11-29 06:36:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:36:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703262238] [2023-11-29 06:36:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:36:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:36:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:44,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:44,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:36:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:45,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:36:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:36:45,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 06:36:45 BoogieIcfgContainer [2023-11-29 06:36:45,204 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-29 06:36:45,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:36:45,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:36:45,205 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:36:45,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:36:26" (3/4) ... [2023-11-29 06:36:45,206 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-29 06:36:45,251 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 06:36:45,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:36:45,251 INFO L158 Benchmark]: Toolchain (without parser) took 19975.71ms. Allocated memory was 148.9MB in the beginning and 12.4GB in the end (delta: 12.2GB). Free memory was 102.7MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2023-11-29 06:36:45,252 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:36:45,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.54ms. Allocated memory is still 148.9MB. Free memory was 102.4MB in the beginning and 91.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 06:36:45,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.85ms. Allocated memory is still 148.9MB. Free memory was 90.6MB in the beginning and 88.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:36:45,253 INFO L158 Benchmark]: Boogie Preprocessor took 41.06ms. Allocated memory is still 148.9MB. Free memory was 88.9MB in the beginning and 86.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:36:45,253 INFO L158 Benchmark]: RCFGBuilder took 423.87ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 86.8MB in the beginning and 166.5MB in the end (delta: -79.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2023-11-29 06:36:45,254 INFO L158 Benchmark]: BuchiAutomizer took 19179.91ms. Allocated memory was 197.1MB in the beginning and 12.4GB in the end (delta: 12.2GB). Free memory was 166.5MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2023-11-29 06:36:45,254 INFO L158 Benchmark]: Witness Printer took 46.62ms. Allocated memory is still 12.4GB. Free memory was 9.3GB in the beginning and 9.3GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:36:45,256 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.17ms. Allocated memory is still 104.9MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.54ms. Allocated memory is still 148.9MB. Free memory was 102.4MB in the beginning and 91.0MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.85ms. Allocated memory is still 148.9MB. Free memory was 90.6MB in the beginning and 88.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.06ms. Allocated memory is still 148.9MB. Free memory was 88.9MB in the beginning and 86.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 423.87ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 86.8MB in the beginning and 166.5MB in the end (delta: -79.7MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 19179.91ms. Allocated memory was 197.1MB in the beginning and 12.4GB in the end (delta: 12.2GB). Free memory was 166.5MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 46.62ms. Allocated memory is still 12.4GB. Free memory was 9.3GB in the beginning and 9.3GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 15.9s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 8.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 4.7s Buchi closure took 0.2s. 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, 797 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 2495 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1529 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI13 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: 56]: 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; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: 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; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-29 06:36:45,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c27944d-3880-44f2-b73d-cf811c391d8e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, 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)