./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:27:04,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:27:04,181 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 16:27:04,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:27:04,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:27:04,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:27:04,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:27:04,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:27:04,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:27:04,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:27:04,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:27:04,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:27:04,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:27:04,233 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 16:27:04,234 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 16:27:04,234 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 16:27:04,234 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 16:27:04,234 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 16:27:04,234 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 16:27:04,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 16:27:04,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 16:27:04,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:27:04,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:27:04,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:27:04,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:27:04,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:27:04,238 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 16:27:04,238 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2024-11-13 16:27:04,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:27:04,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:27:04,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:27:04,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:27:04,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:27:04,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/locks/test_locks_7.c Unable to find full path for "g++" [2024-11-13 16:27:06,322 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:27:06,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:27:06,638 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/sv-benchmarks/c/locks/test_locks_7.c [2024-11-13 16:27:06,670 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/data/feff0aec7/d8e5bcd7d8a945a8b825b3f4072abf03/FLAG00dfc2f98 [2024-11-13 16:27:06,916 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/data/feff0aec7/d8e5bcd7d8a945a8b825b3f4072abf03 [2024-11-13 16:27:06,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:27:06,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:27:06,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:27:06,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:27:06,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:27:06,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:27:06" (1/1) ... [2024-11-13 16:27:06,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a66e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:06, skipping insertion in model container [2024-11-13 16:27:06,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:27:06" (1/1) ... [2024-11-13 16:27:06,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:27:07,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:27:07,154 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:27:07,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:27:07,202 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:27:07,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07 WrapperNode [2024-11-13 16:27:07,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:27:07,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:27:07,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:27:07,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:27:07,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,243 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2024-11-13 16:27:07,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:27:07,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:27:07,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:27:07,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:27:07,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 16:27:07,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:27:07,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:27:07,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:27:07,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:27:07,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (1/1) ... [2024-11-13 16:27:07,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:27:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:27:07,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:27:07,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 16:27:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:27:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:27:07,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:27:07,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:27:07,456 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:27:07,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:27:07,667 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 16:27:07,667 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:27:07,678 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:27:07,678 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:27:07,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:27:07 BoogieIcfgContainer [2024-11-13 16:27:07,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:27:07,680 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 16:27:07,680 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 16:27:07,685 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 16:27:07,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:27:07,686 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 04:27:06" (1/3) ... [2024-11-13 16:27:07,688 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d709c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:27:07, skipping insertion in model container [2024-11-13 16:27:07,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:27:07,688 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:27:07" (2/3) ... [2024-11-13 16:27:07,688 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d709c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:27:07, skipping insertion in model container [2024-11-13 16:27:07,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:27:07,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:27:07" (3/3) ... [2024-11-13 16:27:07,690 INFO L333 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2024-11-13 16:27:07,745 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 16:27:07,746 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 16:27:07,746 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 16:27:07,746 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 16:27:07,746 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 16:27:07,746 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 16:27:07,747 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 16:27:07,747 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 16:27:07,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:07,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-13 16:27:07,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:07,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:07,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:07,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:07,774 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 16:27:07,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:07,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-11-13 16:27:07,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:07,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:07,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:07,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:07,787 INFO L745 eck$LassoCheckResult]: Stem: 29#$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(15, 2);call #Ultimate.allocInit(12, 3); 5#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_~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_~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_~cond~0#1; 17#L113-1true [2024-11-13 16:27:07,788 INFO L747 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 27#L34true 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; 30#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 26#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L77-1true assume !(0 != main_~p1~0#1); 31#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2024-11-13 16:27:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 16:27:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587137185] [2024-11-13 16:27:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:07,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:07,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:07,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1253571452, now seen corresponding path program 1 times [2024-11-13 16:27:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065979715] [2024-11-13 16:27:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065979715] [2024-11-13 16:27:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065979715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:08,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:08,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59684521] [2024-11-13 16:27:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:08,098 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:27:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:08,132 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:08,191 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2024-11-13 16:27:08,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 93 transitions. [2024-11-13 16:27:08,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-11-13 16:27:08,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 47 states and 73 transitions. [2024-11-13 16:27:08,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-13 16:27:08,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-13 16:27:08,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2024-11-13 16:27:08,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:27:08,210 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-11-13 16:27:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2024-11-13 16:27:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-13 16:27:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2024-11-13 16:27:08,246 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-11-13 16:27:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:08,252 INFO L424 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2024-11-13 16:27:08,254 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 16:27:08,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2024-11-13 16:27:08,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-11-13 16:27:08,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:08,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:08,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:08,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:08,257 INFO L745 eck$LassoCheckResult]: Stem: 120#$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(15, 2);call #Ultimate.allocInit(12, 3); 99#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_~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_~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_~cond~0#1; 100#L113-1 [2024-11-13 16:27:08,257 INFO L747 eck$LassoCheckResult]: Loop: 100#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 115#L34 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; 119#L53 assume !(0 != main_~p1~0#1); 122#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 141#L57-1 assume !(0 != main_~p3~0#1); 140#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 139#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 138#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 137#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 136#L77-1 assume !(0 != main_~p1~0#1); 135#L83-1 assume !(0 != main_~p2~0#1); 133#L88-1 assume !(0 != main_~p3~0#1); 131#L93-1 assume !(0 != main_~p4~0#1); 129#L98-1 assume !(0 != main_~p5~0#1); 103#L103-1 assume !(0 != main_~p6~0#1); 105#L108-1 assume !(0 != main_~p7~0#1); 100#L113-1 [2024-11-13 16:27:08,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-13 16:27:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694271023] [2024-11-13 16:27:08,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:08,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2030278594, now seen corresponding path program 1 times [2024-11-13 16:27:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983207852] [2024-11-13 16:27:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:08,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983207852] [2024-11-13 16:27:08,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983207852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:08,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:08,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:08,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747774785] [2024-11-13 16:27:08,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:08,359 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:27:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:08,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:08,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:08,360 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:08,388 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2024-11-13 16:27:08,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2024-11-13 16:27:08,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2024-11-13 16:27:08,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2024-11-13 16:27:08,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2024-11-13 16:27:08,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2024-11-13 16:27:08,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2024-11-13 16:27:08,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:27:08,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-13 16:27:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2024-11-13 16:27:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-13 16:27:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-11-13 16:27:08,407 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-13 16:27:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:08,409 INFO L424 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-11-13 16:27:08,409 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 16:27:08,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2024-11-13 16:27:08,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2024-11-13 16:27:08,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:08,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:08,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:08,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:08,411 INFO L745 eck$LassoCheckResult]: Stem: 270#$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(15, 2);call #Ultimate.allocInit(12, 3); 242#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_~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_~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_~cond~0#1; 243#L113-1 [2024-11-13 16:27:08,412 INFO L747 eck$LassoCheckResult]: Loop: 243#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 288#L34 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; 289#L53 assume !(0 != main_~p1~0#1); 304#L53-2 assume !(0 != main_~p2~0#1); 254#L57-1 assume !(0 != main_~p3~0#1); 249#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 250#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 266#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 267#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 296#L77-1 assume !(0 != main_~p1~0#1); 272#L83-1 assume !(0 != main_~p2~0#1); 274#L88-1 assume !(0 != main_~p3~0#1); 326#L93-1 assume !(0 != main_~p4~0#1); 258#L98-1 assume !(0 != main_~p5~0#1); 260#L103-1 assume !(0 != main_~p6~0#1); 307#L108-1 assume !(0 != main_~p7~0#1); 243#L113-1 [2024-11-13 16:27:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-13 16:27:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645732723] [2024-11-13 16:27:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:08,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1443472580, now seen corresponding path program 1 times [2024-11-13 16:27:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403855102] [2024-11-13 16:27:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403855102] [2024-11-13 16:27:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403855102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:08,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:08,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918199207] [2024-11-13 16:27:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:08,472 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:27:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:08,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:08,473 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:08,494 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2024-11-13 16:27:08,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2024-11-13 16:27:08,496 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2024-11-13 16:27:08,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2024-11-13 16:27:08,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-11-13 16:27:08,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-11-13 16:27:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2024-11-13 16:27:08,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:27:08,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-11-13 16:27:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2024-11-13 16:27:08,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-13 16:27:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2024-11-13 16:27:08,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-11-13 16:27:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:08,532 INFO L424 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-11-13 16:27:08,532 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 16:27:08,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2024-11-13 16:27:08,538 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2024-11-13 16:27:08,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:08,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:08,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:08,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:08,539 INFO L745 eck$LassoCheckResult]: Stem: 536#$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(15, 2);call #Ultimate.allocInit(12, 3); 512#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_~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_~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_~cond~0#1; 513#L113-1 [2024-11-13 16:27:08,539 INFO L747 eck$LassoCheckResult]: Loop: 513#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 577#L34 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; 572#L53 assume !(0 != main_~p1~0#1); 573#L53-2 assume !(0 != main_~p2~0#1); 625#L57-1 assume !(0 != main_~p3~0#1); 623#L61-1 assume !(0 != main_~p4~0#1); 620#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 618#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 615#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 611#L77-1 assume !(0 != main_~p1~0#1); 609#L83-1 assume !(0 != main_~p2~0#1); 608#L88-1 assume !(0 != main_~p3~0#1); 605#L93-1 assume !(0 != main_~p4~0#1); 604#L98-1 assume !(0 != main_~p5~0#1); 601#L103-1 assume !(0 != main_~p6~0#1); 598#L108-1 assume !(0 != main_~p7~0#1); 513#L113-1 [2024-11-13 16:27:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-13 16:27:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826371469] [2024-11-13 16:27:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:08,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2144537158, now seen corresponding path program 1 times [2024-11-13 16:27:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514536061] [2024-11-13 16:27:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:08,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:08,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514536061] [2024-11-13 16:27:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514536061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521828118] [2024-11-13 16:27:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:08,626 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:27:08,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:08,626 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:08,664 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2024-11-13 16:27:08,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2024-11-13 16:27:08,670 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2024-11-13 16:27:08,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2024-11-13 16:27:08,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2024-11-13 16:27:08,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2024-11-13 16:27:08,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2024-11-13 16:27:08,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:27:08,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-11-13 16:27:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2024-11-13 16:27:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2024-11-13 16:27:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2024-11-13 16:27:08,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-11-13 16:27:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:08,702 INFO L424 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2024-11-13 16:27:08,702 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 16:27:08,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2024-11-13 16:27:08,704 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2024-11-13 16:27:08,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:08,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:08,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:08,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:08,705 INFO L745 eck$LassoCheckResult]: Stem: 1054#$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(15, 2);call #Ultimate.allocInit(12, 3); 1030#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_~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_~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_~cond~0#1; 1031#L113-1 [2024-11-13 16:27:08,706 INFO L747 eck$LassoCheckResult]: Loop: 1031#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1076#L34 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; 1077#L53 assume !(0 != main_~p1~0#1); 1128#L53-2 assume !(0 != main_~p2~0#1); 1126#L57-1 assume !(0 != main_~p3~0#1); 1122#L61-1 assume !(0 != main_~p4~0#1); 1120#L65-1 assume !(0 != main_~p5~0#1); 1118#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1116#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1112#L77-1 assume !(0 != main_~p1~0#1); 1108#L83-1 assume !(0 != main_~p2~0#1); 1105#L88-1 assume !(0 != main_~p3~0#1); 1100#L93-1 assume !(0 != main_~p4~0#1); 1097#L98-1 assume !(0 != main_~p5~0#1); 1098#L103-1 assume !(0 != main_~p6~0#1); 1092#L108-1 assume !(0 != main_~p7~0#1); 1031#L113-1 [2024-11-13 16:27:08,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-13 16:27:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691670298] [2024-11-13 16:27:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:08,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1751510148, now seen corresponding path program 1 times [2024-11-13 16:27:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291688965] [2024-11-13 16:27:08,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:08,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291688965] [2024-11-13 16:27:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291688965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:27:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29409659] [2024-11-13 16:27:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:08,765 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:27:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:08,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:08,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:08,770 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:08,811 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2024-11-13 16:27:08,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2024-11-13 16:27:08,820 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2024-11-13 16:27:08,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2024-11-13 16:27:08,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2024-11-13 16:27:08,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2024-11-13 16:27:08,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2024-11-13 16:27:08,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:27:08,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-11-13 16:27:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2024-11-13 16:27:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-11-13 16:27:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2024-11-13 16:27:08,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-11-13 16:27:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:08,870 INFO L424 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2024-11-13 16:27:08,870 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 16:27:08,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2024-11-13 16:27:08,875 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2024-11-13 16:27:08,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:08,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:08,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:08,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:08,882 INFO L745 eck$LassoCheckResult]: Stem: 2060#$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(15, 2);call #Ultimate.allocInit(12, 3); 2032#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_~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_~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_~cond~0#1; 2033#L113-1 [2024-11-13 16:27:08,882 INFO L747 eck$LassoCheckResult]: Loop: 2033#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2204#L34 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; 2184#L53 assume !(0 != main_~p1~0#1); 2177#L53-2 assume !(0 != main_~p2~0#1); 2179#L57-1 assume !(0 != main_~p3~0#1); 2355#L61-1 assume !(0 != main_~p4~0#1); 2351#L65-1 assume !(0 != main_~p5~0#1); 2348#L69-1 assume !(0 != main_~p6~0#1); 2346#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2344#L77-1 assume !(0 != main_~p1~0#1); 2342#L83-1 assume !(0 != main_~p2~0#1); 2340#L88-1 assume !(0 != main_~p3~0#1); 2337#L93-1 assume !(0 != main_~p4~0#1); 2336#L98-1 assume !(0 != main_~p5~0#1); 2333#L103-1 assume !(0 != main_~p6~0#1); 2334#L108-1 assume !(0 != main_~p7~0#1); 2033#L113-1 [2024-11-13 16:27:08,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-13 16:27:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965067520] [2024-11-13 16:27:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:08,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1863398778, now seen corresponding path program 1 times [2024-11-13 16:27:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:08,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377748354] [2024-11-13 16:27:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:27:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:27:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:27:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377748354] [2024-11-13 16:27:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377748354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:27:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:27:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:27:08,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042326229] [2024-11-13 16:27:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:27:08,971 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 16:27:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:27:08,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:27:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:27:08,973 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:27:09,006 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2024-11-13 16:27:09,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2024-11-13 16:27:09,017 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2024-11-13 16:27:09,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2024-11-13 16:27:09,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2024-11-13 16:27:09,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2024-11-13 16:27:09,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2024-11-13 16:27:09,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:27:09,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-11-13 16:27:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2024-11-13 16:27:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2024-11-13 16:27:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:27:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2024-11-13 16:27:09,063 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-11-13 16:27:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:27:09,064 INFO L424 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2024-11-13 16:27:09,065 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 16:27:09,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2024-11-13 16:27:09,074 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2024-11-13 16:27:09,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:27:09,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:27:09,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:27:09,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:27:09,075 INFO L745 eck$LassoCheckResult]: Stem: 4006#$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(15, 2);call #Ultimate.allocInit(12, 3); 3978#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_~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_~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_~cond~0#1; 3979#L113-1 [2024-11-13 16:27:09,075 INFO L747 eck$LassoCheckResult]: Loop: 3979#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4215#L34 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; 4213#L53 assume !(0 != main_~p1~0#1); 4208#L53-2 assume !(0 != main_~p2~0#1); 4202#L57-1 assume !(0 != main_~p3~0#1); 4197#L61-1 assume !(0 != main_~p4~0#1); 4198#L65-1 assume !(0 != main_~p5~0#1); 4245#L69-1 assume !(0 != main_~p6~0#1); 4243#L73-1 assume !(0 != main_~p7~0#1); 4239#L77-1 assume !(0 != main_~p1~0#1); 4231#L83-1 assume !(0 != main_~p2~0#1); 4230#L88-1 assume !(0 != main_~p3~0#1); 4077#L93-1 assume !(0 != main_~p4~0#1); 4078#L98-1 assume !(0 != main_~p5~0#1); 4222#L103-1 assume !(0 != main_~p6~0#1); 4219#L108-1 assume !(0 != main_~p7~0#1); 3979#L113-1 [2024-11-13 16:27:09,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-13 16:27:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424863007] [2024-11-13 16:27:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:09,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1622221892, now seen corresponding path program 1 times [2024-11-13 16:27:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748811245] [2024-11-13 16:27:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:27:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2131059718, now seen corresponding path program 1 times [2024-11-13 16:27:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:27:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936683771] [2024-11-13 16:27:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:27:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:27:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:27:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:27:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:27:09,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 04:27:09 BoogieIcfgContainer [2024-11-13 16:27:09,682 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 16:27:09,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:27:09,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:27:09,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:27:09,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:27:07" (3/4) ... [2024-11-13 16:27:09,689 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-13 16:27:09,729 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 16:27:09,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:27:09,731 INFO L158 Benchmark]: Toolchain (without parser) took 2807.69ms. Allocated memory is still 142.6MB. Free memory was 119.5MB in the beginning and 107.1MB in the end (delta: 12.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-13 16:27:09,732 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:09,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.39ms. Allocated memory is still 142.6MB. Free memory was 119.2MB in the beginning and 108.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:27:09,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 107.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:09,735 INFO L158 Benchmark]: Boogie Preprocessor took 55.50ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 105.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:09,735 INFO L158 Benchmark]: RCFGBuilder took 376.74ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.8MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:27:09,736 INFO L158 Benchmark]: BuchiAutomizer took 2002.58ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 109.2MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:09,736 INFO L158 Benchmark]: Witness Printer took 47.74ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:27:09,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 142.6MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.39ms. Allocated memory is still 142.6MB. Free memory was 119.2MB in the beginning and 108.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 107.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.50ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 105.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 376.74ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.8MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2002.58ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 109.2MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 47.74ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. 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, 177 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 349 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 16:27:09,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90c9f50c-2269-467b-9ab7-e0a823bba01b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)