./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:32:20,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:32:20,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:32:20,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:32:20,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:32:20,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:32:20,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:32:20,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:32:20,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:32:20,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:32:20,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:32:20,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:32:20,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:32:20,570 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:32:20,570 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:32:20,571 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:32:20,571 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:32:20,571 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:32:20,572 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:32:20,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:32:20,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:32:20,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:32:20,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:32:20,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:32:20,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:32:20,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:32:20,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:32:20,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:32:20,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:32:20,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:32:20,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:32:20,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:32:20,578 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:32:20,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:32:20,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:32:20,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:32:20,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:32:20,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:32:20,583 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:32:20,583 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-11-09 15:32:20,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:32:20,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:32:20,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:32:20,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:32:20,851 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:32:20,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-09 15:32:22,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:32:22,470 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:32:22,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-11-09 15:32:22,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041f1777c/a6e7e75956444eca855d6f970b8f9e99/FLAG0eb0b9209 [2024-11-09 15:32:22,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041f1777c/a6e7e75956444eca855d6f970b8f9e99 [2024-11-09 15:32:22,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:32:22,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:32:22,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:22,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:32:22,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:32:22,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4d7b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:22, skipping insertion in model container [2024-11-09 15:32:22,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:32:22" (1/1) ... [2024-11-09 15:32:22,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:32:23,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:23,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:32:23,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:32:23,170 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:32:23,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23 WrapperNode [2024-11-09 15:32:23,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:32:23,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:23,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:32:23,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:32:23,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,217 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2024-11-09 15:32:23,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:32:23,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:32:23,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:32:23,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:32:23,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,267 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-09 15:32:23,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:32:23,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:32:23,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:32:23,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:32:23,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (1/1) ... [2024-11-09 15:32:23,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:32:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:32:23,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:32:23,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:32:23,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:32:23,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:32:23,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:32:23,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:32:23,452 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:32:23,455 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:32:23,750 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-09 15:32:23,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:32:23,768 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:32:23,769 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:32:23,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:23 BoogieIcfgContainer [2024-11-09 15:32:23,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:32:23,770 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:32:23,770 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:32:23,775 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:32:23,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:23,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:32:22" (1/3) ... [2024-11-09 15:32:23,777 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@425a2a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:23, skipping insertion in model container [2024-11-09 15:32:23,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:23,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:32:23" (2/3) ... [2024-11-09 15:32:23,778 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@425a2a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:32:23, skipping insertion in model container [2024-11-09 15:32:23,778 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:32:23,778 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:23" (3/3) ... [2024-11-09 15:32:23,779 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_14-2.c [2024-11-09 15:32:23,836 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:32:23,836 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:32:23,837 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:32:23,837 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:32:23,837 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:32:23,837 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:32:23,838 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:32:23,838 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:32:23,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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-09 15:32:23,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-11-09 15:32:23,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:23,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:32:23,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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-09 15:32:23,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-11-09 15:32:23,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:23,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:23,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:23,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:23,887 INFO L745 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 35#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 32#L211true [2024-11-09 15:32:23,888 INFO L747 eck$LassoCheckResult]: Loop: 32#L211true assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 46#L55true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 22#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 49#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 52#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 27#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 39#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34#L124-1true assume !(0 != main_~p11~0#1); 16#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 48#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 42#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 38#L140-1true assume !(0 != main_~p1~0#1); 17#L146-1true assume 0 != main_~p2~0#1; 28#L152true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 13#L151true assume !(0 != main_~p3~0#1); 29#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 24#L171-1true assume !(0 != main_~p7~0#1); 20#L176-1true assume !(0 != main_~p8~0#1); 50#L181-1true assume !(0 != main_~p9~0#1); 21#L186-1true assume !(0 != main_~p10~0#1); 37#L191-1true assume !(0 != main_~p11~0#1); 51#L196-1true assume !(0 != main_~p12~0#1); 25#L201-1true assume !(0 != main_~p13~0#1); 14#L206-1true assume 0 != main_~p14~0#1; 8#L212true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 32#L211true [2024-11-09 15:32:23,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:32:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647723146] [2024-11-09 15:32:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1237702727, now seen corresponding path program 1 times [2024-11-09 15:32:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063936008] [2024-11-09 15:32:24,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,190 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-09 15:32:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063936008] [2024-11-09 15:32:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063936008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677343458] [2024-11-09 15:32:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,198 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,226 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,265 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2024-11-09 15:32:24,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 177 transitions. [2024-11-09 15:32:24,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-11-09 15:32:24,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 89 states and 139 transitions. [2024-11-09 15:32:24,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2024-11-09 15:32:24,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2024-11-09 15:32:24,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 139 transitions. [2024-11-09 15:32:24,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-09 15:32:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 139 transitions. [2024-11-09 15:32:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 15:32:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 88 states have internal predecessors, (139), 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-09 15:32:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 139 transitions. [2024-11-09 15:32:24,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-09 15:32:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,333 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 139 transitions. [2024-11-09 15:32:24,333 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:32:24,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 139 transitions. [2024-11-09 15:32:24,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-11-09 15:32:24,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:24,338 INFO L745 eck$LassoCheckResult]: Stem: 208#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 175#L211 [2024-11-09 15:32:24,338 INFO L747 eck$LassoCheckResult]: Loop: 175#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 202#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 203#L88 assume !(0 != main_~p1~0#1); 184#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 162#L92-1 assume !(0 != main_~p3~0#1); 160#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 161#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 169#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 209#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 193#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 219#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 217#L140-1 assume !(0 != main_~p1~0#1); 218#L146-1 assume 0 != main_~p2~0#1; 246#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 245#L151 assume !(0 != main_~p3~0#1); 243#L156-1 assume !(0 != main_~p4~0#1); 241#L161-1 assume !(0 != main_~p5~0#1); 239#L166-1 assume !(0 != main_~p6~0#1); 206#L171-1 assume !(0 != main_~p7~0#1); 198#L176-1 assume !(0 != main_~p8~0#1); 200#L181-1 assume !(0 != main_~p9~0#1); 232#L186-1 assume !(0 != main_~p10~0#1); 231#L191-1 assume !(0 != main_~p11~0#1); 214#L196-1 assume !(0 != main_~p12~0#1); 191#L201-1 assume !(0 != main_~p13~0#1); 167#L206-1 assume 0 != main_~p14~0#1; 226#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 175#L211 [2024-11-09 15:32:24,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-09 15:32:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045215420] [2024-11-09 15:32:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1215070473, now seen corresponding path program 1 times [2024-11-09 15:32:24,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679943845] [2024-11-09 15:32:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,481 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-09 15:32:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679943845] [2024-11-09 15:32:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679943845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464912071] [2024-11-09 15:32:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,482 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,483 INFO L87 Difference]: Start difference. First operand 89 states and 139 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,517 INFO L93 Difference]: Finished difference Result 174 states and 270 transitions. [2024-11-09 15:32:24,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 270 transitions. [2024-11-09 15:32:24,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2024-11-09 15:32:24,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 270 transitions. [2024-11-09 15:32:24,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-11-09 15:32:24,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-11-09 15:32:24,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 270 transitions. [2024-11-09 15:32:24,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2024-11-09 15:32:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 270 transitions. [2024-11-09 15:32:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-09 15:32:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5517241379310345) internal successors, (270), 173 states have internal predecessors, (270), 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-09 15:32:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 270 transitions. [2024-11-09 15:32:24,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 270 transitions. [2024-11-09 15:32:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,549 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 270 transitions. [2024-11-09 15:32:24,549 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:32:24,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 270 transitions. [2024-11-09 15:32:24,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2024-11-09 15:32:24,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:24,555 INFO L745 eck$LassoCheckResult]: Stem: 480#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 444#L211 [2024-11-09 15:32:24,555 INFO L747 eck$LassoCheckResult]: Loop: 444#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 511#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 510#L88 assume !(0 != main_~p1~0#1); 509#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 508#L92-1 assume !(0 != main_~p3~0#1); 506#L96-1 assume !(0 != main_~p4~0#1); 507#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 482#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 483#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 486#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 487#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 497#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 498#L124-1 assume !(0 != main_~p11~0#1); 464#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 465#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 540#L146-1 assume 0 != main_~p2~0#1; 537#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 535#L151 assume !(0 != main_~p3~0#1); 532#L156-1 assume !(0 != main_~p4~0#1); 531#L161-1 assume !(0 != main_~p5~0#1); 529#L166-1 assume !(0 != main_~p6~0#1); 526#L171-1 assume !(0 != main_~p7~0#1); 525#L176-1 assume !(0 != main_~p8~0#1); 523#L181-1 assume !(0 != main_~p9~0#1); 520#L186-1 assume !(0 != main_~p10~0#1); 519#L191-1 assume !(0 != main_~p11~0#1); 517#L196-1 assume !(0 != main_~p12~0#1); 515#L201-1 assume !(0 != main_~p13~0#1); 513#L206-1 assume 0 != main_~p14~0#1; 512#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 444#L211 [2024-11-09 15:32:24,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-09 15:32:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108168052] [2024-11-09 15:32:24,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,569 INFO L85 PathProgramCache]: Analyzing trace with hash 708157561, now seen corresponding path program 1 times [2024-11-09 15:32:24,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970045610] [2024-11-09 15:32:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,629 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-09 15:32:24,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970045610] [2024-11-09 15:32:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970045610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114737721] [2024-11-09 15:32:24,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,630 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,631 INFO L87 Difference]: Start difference. First operand 174 states and 270 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,663 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2024-11-09 15:32:24,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 526 transitions. [2024-11-09 15:32:24,666 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2024-11-09 15:32:24,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 526 transitions. [2024-11-09 15:32:24,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2024-11-09 15:32:24,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2024-11-09 15:32:24,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 526 transitions. [2024-11-09 15:32:24,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2024-11-09 15:32:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 526 transitions. [2024-11-09 15:32:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-09 15:32:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5380116959064327) internal successors, (526), 341 states have internal predecessors, (526), 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-09 15:32:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 526 transitions. [2024-11-09 15:32:24,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 526 transitions. [2024-11-09 15:32:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 342 states and 526 transitions. [2024-11-09 15:32:24,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:32:24,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 526 transitions. [2024-11-09 15:32:24,707 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2024-11-09 15:32:24,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,708 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:24,708 INFO L745 eck$LassoCheckResult]: Stem: 998#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 966#L211 [2024-11-09 15:32:24,709 INFO L747 eck$LassoCheckResult]: Loop: 966#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1028#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1024#L88 assume !(0 != main_~p1~0#1); 1018#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1014#L92-1 assume !(0 != main_~p3~0#1); 1015#L96-1 assume !(0 != main_~p4~0#1); 1154#L100-1 assume !(0 != main_~p5~0#1); 1151#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1149#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1147#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1145#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1143#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1141#L124-1 assume !(0 != main_~p11~0#1); 1139#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1137#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1135#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1132#L140-1 assume !(0 != main_~p1~0#1); 1129#L146-1 assume 0 != main_~p2~0#1; 1127#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1120#L151 assume !(0 != main_~p3~0#1); 1115#L156-1 assume !(0 != main_~p4~0#1); 1112#L161-1 assume !(0 != main_~p5~0#1); 1109#L166-1 assume !(0 != main_~p6~0#1); 1104#L171-1 assume !(0 != main_~p7~0#1); 1101#L176-1 assume !(0 != main_~p8~0#1); 1098#L181-1 assume !(0 != main_~p9~0#1); 1094#L186-1 assume !(0 != main_~p10~0#1); 1091#L191-1 assume !(0 != main_~p11~0#1); 1073#L196-1 assume !(0 != main_~p12~0#1); 1049#L201-1 assume !(0 != main_~p13~0#1); 1039#L206-1 assume 0 != main_~p14~0#1; 1035#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 966#L211 [2024-11-09 15:32:24,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,709 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-09 15:32:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393659460] [2024-11-09 15:32:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash 770197175, now seen corresponding path program 1 times [2024-11-09 15:32:24,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916650407] [2024-11-09 15:32:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,765 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-09 15:32:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916650407] [2024-11-09 15:32:24,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916650407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113288083] [2024-11-09 15:32:24,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,767 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,768 INFO L87 Difference]: Start difference. First operand 342 states and 526 transitions. cyclomatic complexity: 192 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,792 INFO L93 Difference]: Finished difference Result 674 states and 1026 transitions. [2024-11-09 15:32:24,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1026 transitions. [2024-11-09 15:32:24,799 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2024-11-09 15:32:24,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1026 transitions. [2024-11-09 15:32:24,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2024-11-09 15:32:24,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2024-11-09 15:32:24,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1026 transitions. [2024-11-09 15:32:24,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2024-11-09 15:32:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1026 transitions. [2024-11-09 15:32:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2024-11-09 15:32:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5222551928783383) internal successors, (1026), 673 states have internal predecessors, (1026), 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-09 15:32:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1026 transitions. [2024-11-09 15:32:24,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1026 transitions. [2024-11-09 15:32:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,826 INFO L425 stractBuchiCegarLoop]: Abstraction has 674 states and 1026 transitions. [2024-11-09 15:32:24,826 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:32:24,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1026 transitions. [2024-11-09 15:32:24,829 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2024-11-09 15:32:24,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,830 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:24,830 INFO L745 eck$LassoCheckResult]: Stem: 2021#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1987#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1988#L211 [2024-11-09 15:32:24,831 INFO L747 eck$LassoCheckResult]: Loop: 1988#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2047#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2048#L88 assume !(0 != main_~p1~0#1); 2241#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2248#L92-1 assume !(0 != main_~p3~0#1); 2247#L96-1 assume !(0 != main_~p4~0#1); 2244#L100-1 assume !(0 != main_~p5~0#1); 2170#L104-1 assume !(0 != main_~p6~0#1); 2172#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2162#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2163#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2154#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2155#L124-1 assume !(0 != main_~p11~0#1); 2146#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2147#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2138#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2139#L140-1 assume !(0 != main_~p1~0#1); 2214#L146-1 assume 0 != main_~p2~0#1; 2211#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2208#L151 assume !(0 != main_~p3~0#1); 2207#L156-1 assume !(0 != main_~p4~0#1); 2288#L161-1 assume !(0 != main_~p5~0#1); 2287#L166-1 assume !(0 != main_~p6~0#1); 2285#L171-1 assume !(0 != main_~p7~0#1); 2284#L176-1 assume !(0 != main_~p8~0#1); 2274#L181-1 assume !(0 != main_~p9~0#1); 2234#L186-1 assume !(0 != main_~p10~0#1); 2235#L191-1 assume !(0 != main_~p11~0#1); 2176#L196-1 assume !(0 != main_~p12~0#1); 2175#L201-1 assume !(0 != main_~p13~0#1); 2065#L206-1 assume 0 != main_~p14~0#1; 2059#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1988#L211 [2024-11-09 15:32:24,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-09 15:32:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911037982] [2024-11-09 15:32:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash 910745785, now seen corresponding path program 1 times [2024-11-09 15:32:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670711282] [2024-11-09 15:32:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:24,894 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-09 15:32:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670711282] [2024-11-09 15:32:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670711282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:24,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:24,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947516853] [2024-11-09 15:32:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:24,898 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:24,899 INFO L87 Difference]: Start difference. First operand 674 states and 1026 transitions. cyclomatic complexity: 368 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:24,920 INFO L93 Difference]: Finished difference Result 1330 states and 2002 transitions. [2024-11-09 15:32:24,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2002 transitions. [2024-11-09 15:32:24,932 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2024-11-09 15:32:24,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2002 transitions. [2024-11-09 15:32:24,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2024-11-09 15:32:24,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2024-11-09 15:32:24,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2002 transitions. [2024-11-09 15:32:24,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:24,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2024-11-09 15:32:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2002 transitions. [2024-11-09 15:32:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2024-11-09 15:32:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5052631578947369) internal successors, (2002), 1329 states have internal predecessors, (2002), 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-09 15:32:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2002 transitions. [2024-11-09 15:32:24,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2024-11-09 15:32:24,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:24,973 INFO L425 stractBuchiCegarLoop]: Abstraction has 1330 states and 2002 transitions. [2024-11-09 15:32:24,973 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:32:24,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2002 transitions. [2024-11-09 15:32:24,980 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2024-11-09 15:32:24,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:24,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:24,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:24,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:24,981 INFO L745 eck$LassoCheckResult]: Stem: 4029#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3997#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3998#L211 [2024-11-09 15:32:24,981 INFO L747 eck$LassoCheckResult]: Loop: 3998#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4119#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4120#L88 assume !(0 != main_~p1~0#1); 4265#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4262#L92-1 assume !(0 != main_~p3~0#1); 4259#L96-1 assume !(0 != main_~p4~0#1); 4254#L100-1 assume !(0 != main_~p5~0#1); 4248#L104-1 assume !(0 != main_~p6~0#1); 4242#L108-1 assume !(0 != main_~p7~0#1); 4239#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4236#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4198#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4199#L124-1 assume !(0 != main_~p11~0#1); 4192#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4193#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4185#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4186#L140-1 assume !(0 != main_~p1~0#1); 4223#L146-1 assume 0 != main_~p2~0#1; 4224#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4216#L151 assume !(0 != main_~p3~0#1); 4215#L156-1 assume !(0 != main_~p4~0#1); 4285#L161-1 assume !(0 != main_~p5~0#1); 4282#L166-1 assume !(0 != main_~p6~0#1); 4279#L171-1 assume !(0 != main_~p7~0#1); 4278#L176-1 assume !(0 != main_~p8~0#1); 4275#L181-1 assume !(0 != main_~p9~0#1); 4272#L186-1 assume !(0 != main_~p10~0#1); 4271#L191-1 assume !(0 != main_~p11~0#1); 4222#L196-1 assume !(0 != main_~p12~0#1); 4137#L201-1 assume !(0 != main_~p13~0#1); 4136#L206-1 assume 0 != main_~p14~0#1; 4127#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 3998#L211 [2024-11-09 15:32:24,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-09 15:32:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439317199] [2024-11-09 15:32:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:24,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 776732279, now seen corresponding path program 1 times [2024-11-09 15:32:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409169356] [2024-11-09 15:32:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:25,045 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-09 15:32:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409169356] [2024-11-09 15:32:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409169356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166100566] [2024-11-09 15:32:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:25,047 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:25,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:25,048 INFO L87 Difference]: Start difference. First operand 1330 states and 2002 transitions. cyclomatic complexity: 704 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:25,082 INFO L93 Difference]: Finished difference Result 2626 states and 3906 transitions. [2024-11-09 15:32:25,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 3906 transitions. [2024-11-09 15:32:25,108 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2024-11-09 15:32:25,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 3906 transitions. [2024-11-09 15:32:25,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2024-11-09 15:32:25,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2024-11-09 15:32:25,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 3906 transitions. [2024-11-09 15:32:25,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:25,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2024-11-09 15:32:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 3906 transitions. [2024-11-09 15:32:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2024-11-09 15:32:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.4874333587204875) internal successors, (3906), 2625 states have internal predecessors, (3906), 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-09 15:32:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3906 transitions. [2024-11-09 15:32:25,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2024-11-09 15:32:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:25,225 INFO L425 stractBuchiCegarLoop]: Abstraction has 2626 states and 3906 transitions. [2024-11-09 15:32:25,225 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:32:25,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 3906 transitions. [2024-11-09 15:32:25,241 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2024-11-09 15:32:25,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:25,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:25,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:25,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:25,245 INFO L745 eck$LassoCheckResult]: Stem: 8000#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7960#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7961#L211 [2024-11-09 15:32:25,245 INFO L747 eck$LassoCheckResult]: Loop: 7961#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8381#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8374#L88 assume !(0 != main_~p1~0#1); 8376#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8496#L92-1 assume !(0 != main_~p3~0#1); 8493#L96-1 assume !(0 != main_~p4~0#1); 8490#L100-1 assume !(0 != main_~p5~0#1); 8487#L104-1 assume !(0 != main_~p6~0#1); 8484#L108-1 assume !(0 != main_~p7~0#1); 8481#L112-1 assume !(0 != main_~p8~0#1); 8479#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8477#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8474#L124-1 assume !(0 != main_~p11~0#1); 8472#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8470#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8469#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8467#L140-1 assume !(0 != main_~p1~0#1); 8466#L146-1 assume 0 != main_~p2~0#1; 8465#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8464#L151 assume !(0 != main_~p3~0#1); 8449#L156-1 assume !(0 != main_~p4~0#1); 8441#L161-1 assume !(0 != main_~p5~0#1); 8443#L166-1 assume !(0 != main_~p6~0#1); 8435#L171-1 assume !(0 != main_~p7~0#1); 8431#L176-1 assume !(0 != main_~p8~0#1); 8427#L181-1 assume !(0 != main_~p9~0#1); 8426#L186-1 assume !(0 != main_~p10~0#1); 8408#L191-1 assume !(0 != main_~p11~0#1); 8401#L196-1 assume !(0 != main_~p12~0#1); 8395#L201-1 assume !(0 != main_~p13~0#1); 8390#L206-1 assume 0 != main_~p14~0#1; 8386#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 7961#L211 [2024-11-09 15:32:25,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-09 15:32:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:25,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360536490] [2024-11-09 15:32:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:25,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:25,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:25,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1028706055, now seen corresponding path program 1 times [2024-11-09 15:32:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022242132] [2024-11-09 15:32:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:25,306 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-09 15:32:25,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022242132] [2024-11-09 15:32:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022242132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:25,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154313619] [2024-11-09 15:32:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:25,311 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:25,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:25,311 INFO L87 Difference]: Start difference. First operand 2626 states and 3906 transitions. cyclomatic complexity: 1344 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:25,353 INFO L93 Difference]: Finished difference Result 5186 states and 7618 transitions. [2024-11-09 15:32:25,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7618 transitions. [2024-11-09 15:32:25,389 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2024-11-09 15:32:25,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7618 transitions. [2024-11-09 15:32:25,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2024-11-09 15:32:25,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2024-11-09 15:32:25,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7618 transitions. [2024-11-09 15:32:25,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:25,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2024-11-09 15:32:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7618 transitions. [2024-11-09 15:32:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2024-11-09 15:32:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.4689548785190898) internal successors, (7618), 5185 states have internal predecessors, (7618), 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-09 15:32:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7618 transitions. [2024-11-09 15:32:25,595 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2024-11-09 15:32:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:25,597 INFO L425 stractBuchiCegarLoop]: Abstraction has 5186 states and 7618 transitions. [2024-11-09 15:32:25,597 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:32:25,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7618 transitions. [2024-11-09 15:32:25,622 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2024-11-09 15:32:25,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:25,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:25,624 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:25,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:25,625 INFO L745 eck$LassoCheckResult]: Stem: 15812#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 15778#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15779#L211 [2024-11-09 15:32:25,625 INFO L747 eck$LassoCheckResult]: Loop: 15779#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16206#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16202#L88 assume !(0 != main_~p1~0#1); 16200#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 16198#L92-1 assume !(0 != main_~p3~0#1); 16194#L96-1 assume !(0 != main_~p4~0#1); 16190#L100-1 assume !(0 != main_~p5~0#1); 16187#L104-1 assume !(0 != main_~p6~0#1); 16188#L108-1 assume !(0 != main_~p7~0#1); 16270#L112-1 assume !(0 != main_~p8~0#1); 16267#L116-1 assume !(0 != main_~p9~0#1); 16265#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16263#L124-1 assume !(0 != main_~p11~0#1); 16261#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16258#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16256#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16254#L140-1 assume !(0 != main_~p1~0#1); 16251#L146-1 assume 0 != main_~p2~0#1; 16248#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 16245#L151 assume !(0 != main_~p3~0#1); 16243#L156-1 assume !(0 != main_~p4~0#1); 16241#L161-1 assume !(0 != main_~p5~0#1); 16239#L166-1 assume !(0 != main_~p6~0#1); 16237#L171-1 assume !(0 != main_~p7~0#1); 16233#L176-1 assume !(0 != main_~p8~0#1); 16229#L181-1 assume !(0 != main_~p9~0#1); 16225#L186-1 assume !(0 != main_~p10~0#1); 16222#L191-1 assume !(0 != main_~p11~0#1); 16218#L196-1 assume !(0 != main_~p12~0#1); 16214#L201-1 assume !(0 != main_~p13~0#1); 16211#L206-1 assume 0 != main_~p14~0#1; 16209#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 15779#L211 [2024-11-09 15:32:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-11-09 15:32:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:25,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361587429] [2024-11-09 15:32:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:25,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:25,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash -809851337, now seen corresponding path program 1 times [2024-11-09 15:32:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002218470] [2024-11-09 15:32:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:25,679 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-09 15:32:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:25,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002218470] [2024-11-09 15:32:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002218470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:25,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287205701] [2024-11-09 15:32:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:25,681 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:25,682 INFO L87 Difference]: Start difference. First operand 5186 states and 7618 transitions. cyclomatic complexity: 2560 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:25,741 INFO L93 Difference]: Finished difference Result 10242 states and 14850 transitions. [2024-11-09 15:32:25,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 14850 transitions. [2024-11-09 15:32:25,819 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2024-11-09 15:32:25,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 14850 transitions. [2024-11-09 15:32:25,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2024-11-09 15:32:25,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2024-11-09 15:32:25,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 14850 transitions. [2024-11-09 15:32:25,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:25,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2024-11-09 15:32:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 14850 transitions. [2024-11-09 15:32:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2024-11-09 15:32:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4499121265377857) internal successors, (14850), 10241 states have internal predecessors, (14850), 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-09 15:32:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 14850 transitions. [2024-11-09 15:32:26,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2024-11-09 15:32:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:26,141 INFO L425 stractBuchiCegarLoop]: Abstraction has 10242 states and 14850 transitions. [2024-11-09 15:32:26,141 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:32:26,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 14850 transitions. [2024-11-09 15:32:26,183 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2024-11-09 15:32:26,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:26,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:26,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:26,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:26,185 INFO L745 eck$LassoCheckResult]: Stem: 31255#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 31213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31214#L211 [2024-11-09 15:32:26,186 INFO L747 eck$LassoCheckResult]: Loop: 31214#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31994#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31992#L88 assume !(0 != main_~p1~0#1); 31991#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 31990#L92-1 assume !(0 != main_~p3~0#1); 31988#L96-1 assume !(0 != main_~p4~0#1); 31986#L100-1 assume !(0 != main_~p5~0#1); 31983#L104-1 assume !(0 != main_~p6~0#1); 31984#L108-1 assume !(0 != main_~p7~0#1); 31965#L112-1 assume !(0 != main_~p8~0#1); 31967#L116-1 assume !(0 != main_~p9~0#1); 31949#L120-1 assume !(0 != main_~p10~0#1); 31951#L124-1 assume !(0 != main_~p11~0#1); 31937#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31938#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31924#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31925#L140-1 assume !(0 != main_~p1~0#1); 31910#L146-1 assume 0 != main_~p2~0#1; 31911#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 31897#L151 assume !(0 != main_~p3~0#1); 31896#L156-1 assume !(0 != main_~p4~0#1); 31883#L161-1 assume !(0 != main_~p5~0#1); 31884#L166-1 assume !(0 != main_~p6~0#1); 32009#L171-1 assume !(0 != main_~p7~0#1); 32007#L176-1 assume !(0 != main_~p8~0#1); 32005#L181-1 assume !(0 != main_~p9~0#1); 32003#L186-1 assume !(0 != main_~p10~0#1); 32002#L191-1 assume !(0 != main_~p11~0#1); 32000#L196-1 assume !(0 != main_~p12~0#1); 31998#L201-1 assume !(0 != main_~p13~0#1); 31996#L206-1 assume 0 != main_~p14~0#1; 31995#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 31214#L211 [2024-11-09 15:32:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-11-09 15:32:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784134649] [2024-11-09 15:32:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:26,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:26,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:26,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash -387149511, now seen corresponding path program 1 times [2024-11-09 15:32:26,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:26,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031119594] [2024-11-09 15:32:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:26,238 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-09 15:32:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031119594] [2024-11-09 15:32:26,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031119594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:26,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:26,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031750416] [2024-11-09 15:32:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:26,240 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:26,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:26,241 INFO L87 Difference]: Start difference. First operand 10242 states and 14850 transitions. cyclomatic complexity: 4864 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:26,381 INFO L93 Difference]: Finished difference Result 20226 states and 28930 transitions. [2024-11-09 15:32:26,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 28930 transitions. [2024-11-09 15:32:26,477 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2024-11-09 15:32:26,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 28930 transitions. [2024-11-09 15:32:26,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2024-11-09 15:32:26,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2024-11-09 15:32:26,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 28930 transitions. [2024-11-09 15:32:26,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:26,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2024-11-09 15:32:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 28930 transitions. [2024-11-09 15:32:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2024-11-09 15:32:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.43033718975576) internal successors, (28930), 20225 states have internal predecessors, (28930), 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-09 15:32:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 28930 transitions. [2024-11-09 15:32:27,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2024-11-09 15:32:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:27,420 INFO L425 stractBuchiCegarLoop]: Abstraction has 20226 states and 28930 transitions. [2024-11-09 15:32:27,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:32:27,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 28930 transitions. [2024-11-09 15:32:27,479 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2024-11-09 15:32:27,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:27,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:27,480 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:27,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:27,481 INFO L745 eck$LassoCheckResult]: Stem: 61720#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 61687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61688#L211 [2024-11-09 15:32:27,481 INFO L747 eck$LassoCheckResult]: Loop: 61688#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62202#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62203#L88 assume !(0 != main_~p1~0#1); 62348#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 62347#L92-1 assume !(0 != main_~p3~0#1); 62345#L96-1 assume !(0 != main_~p4~0#1); 62343#L100-1 assume !(0 != main_~p5~0#1); 62341#L104-1 assume !(0 != main_~p6~0#1); 62340#L108-1 assume !(0 != main_~p7~0#1); 62338#L112-1 assume !(0 != main_~p8~0#1); 62335#L116-1 assume !(0 != main_~p9~0#1); 62331#L120-1 assume !(0 != main_~p10~0#1); 62328#L124-1 assume !(0 != main_~p11~0#1); 62321#L128-1 assume !(0 != main_~p12~0#1); 62315#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62311#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62306#L140-1 assume !(0 != main_~p1~0#1); 62302#L146-1 assume 0 != main_~p2~0#1; 62299#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 62294#L151 assume !(0 != main_~p3~0#1); 62289#L156-1 assume !(0 != main_~p4~0#1); 62073#L161-1 assume !(0 != main_~p5~0#1); 62068#L166-1 assume !(0 != main_~p6~0#1); 62069#L171-1 assume !(0 != main_~p7~0#1); 62274#L176-1 assume !(0 != main_~p8~0#1); 62357#L181-1 assume !(0 != main_~p9~0#1); 62258#L186-1 assume !(0 != main_~p10~0#1); 62259#L191-1 assume !(0 != main_~p11~0#1); 62354#L196-1 assume !(0 != main_~p12~0#1); 62226#L201-1 assume !(0 != main_~p13~0#1); 62218#L206-1 assume 0 != main_~p14~0#1; 62212#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 61688#L211 [2024-11-09 15:32:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-11-09 15:32:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123784965] [2024-11-09 15:32:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:27,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:27,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:27,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2076093253, now seen corresponding path program 1 times [2024-11-09 15:32:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393052287] [2024-11-09 15:32:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:32:27,526 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-09 15:32:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:32:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393052287] [2024-11-09 15:32:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393052287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:32:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:32:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:32:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106125594] [2024-11-09 15:32:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:32:27,528 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:32:27,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:32:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:32:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:32:27,532 INFO L87 Difference]: Start difference. First operand 20226 states and 28930 transitions. cyclomatic complexity: 9216 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:32:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:32:27,654 INFO L93 Difference]: Finished difference Result 39938 states and 56322 transitions. [2024-11-09 15:32:27,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 56322 transitions. [2024-11-09 15:32:27,933 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2024-11-09 15:32:28,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 56322 transitions. [2024-11-09 15:32:28,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2024-11-09 15:32:28,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2024-11-09 15:32:28,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 56322 transitions. [2024-11-09 15:32:28,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:32:28,253 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2024-11-09 15:32:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 56322 transitions. [2024-11-09 15:32:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2024-11-09 15:32:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4102358655916671) internal successors, (56322), 39937 states have internal predecessors, (56322), 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-09 15:32:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 56322 transitions. [2024-11-09 15:32:29,119 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2024-11-09 15:32:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:32:29,120 INFO L425 stractBuchiCegarLoop]: Abstraction has 39938 states and 56322 transitions. [2024-11-09 15:32:29,120 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:32:29,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 56322 transitions. [2024-11-09 15:32:29,241 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2024-11-09 15:32:29,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:32:29,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:32:29,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:32:29,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:32:29,244 INFO L745 eck$LassoCheckResult]: Stem: 121899#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 121854#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121855#L211 [2024-11-09 15:32:29,244 INFO L747 eck$LassoCheckResult]: Loop: 121855#L211 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122057#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122053#L88 assume !(0 != main_~p1~0#1); 122049#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 122045#L92-1 assume !(0 != main_~p3~0#1); 122038#L96-1 assume !(0 != main_~p4~0#1); 122030#L100-1 assume !(0 != main_~p5~0#1); 122022#L104-1 assume !(0 != main_~p6~0#1); 122014#L108-1 assume !(0 != main_~p7~0#1); 122006#L112-1 assume !(0 != main_~p8~0#1); 121998#L116-1 assume !(0 != main_~p9~0#1); 121990#L120-1 assume !(0 != main_~p10~0#1); 121985#L124-1 assume !(0 != main_~p11~0#1); 121978#L128-1 assume !(0 != main_~p12~0#1); 121972#L132-1 assume !(0 != main_~p13~0#1); 121966#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121967#L140-1 assume !(0 != main_~p1~0#1); 122148#L146-1 assume 0 != main_~p2~0#1; 122146#L152 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 122144#L151 assume !(0 != main_~p3~0#1); 122140#L156-1 assume !(0 != main_~p4~0#1); 122133#L161-1 assume !(0 != main_~p5~0#1); 122125#L166-1 assume !(0 != main_~p6~0#1); 122117#L171-1 assume !(0 != main_~p7~0#1); 122109#L176-1 assume !(0 != main_~p8~0#1); 122097#L181-1 assume !(0 != main_~p9~0#1); 122093#L186-1 assume !(0 != main_~p10~0#1); 122084#L191-1 assume !(0 != main_~p11~0#1); 122076#L196-1 assume !(0 != main_~p12~0#1); 122072#L201-1 assume !(0 != main_~p13~0#1); 122068#L206-1 assume 0 != main_~p14~0#1; 122064#L212 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 121855#L211 [2024-11-09 15:32:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-11-09 15:32:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183693921] [2024-11-09 15:32:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:29,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash 224729337, now seen corresponding path program 1 times [2024-11-09 15:32:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740156093] [2024-11-09 15:32:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:29,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:32:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -233466693, now seen corresponding path program 1 times [2024-11-09 15:32:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:32:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614456755] [2024-11-09 15:32:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:32:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:32:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:32:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:29,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:32:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:32:30,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:32:30 BoogieIcfgContainer [2024-11-09 15:32:30,041 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:32:30,042 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:32:30,042 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:32:30,042 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:32:30,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:32:23" (3/4) ... [2024-11-09 15:32:30,045 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:32:30,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:32:30,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:32:30,091 INFO L158 Benchmark]: Toolchain (without parser) took 7228.91ms. Allocated memory was 127.9MB in the beginning and 838.9MB in the end (delta: 710.9MB). Free memory was 58.5MB in the beginning and 469.8MB in the end (delta: -411.3MB). Peak memory consumption was 301.8MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,091 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:32:30,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.66ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.2MB in the beginning and 132.2MB in the end (delta: -74.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.88ms. Allocated memory is still 163.6MB. Free memory was 132.2MB in the beginning and 131.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,092 INFO L158 Benchmark]: Boogie Preprocessor took 76.30ms. Allocated memory is still 163.6MB. Free memory was 131.1MB in the beginning and 128.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,092 INFO L158 Benchmark]: RCFGBuilder took 473.93ms. Allocated memory is still 163.6MB. Free memory was 128.9MB in the beginning and 111.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,092 INFO L158 Benchmark]: BuchiAutomizer took 6270.95ms. Allocated memory was 163.6MB in the beginning and 838.9MB in the end (delta: 675.3MB). Free memory was 111.2MB in the beginning and 472.8MB in the end (delta: -361.6MB). Peak memory consumption was 314.7MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,093 INFO L158 Benchmark]: Witness Printer took 48.00ms. Allocated memory is still 838.9MB. Free memory was 472.8MB in the beginning and 469.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:32:30,094 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.19ms. Allocated memory is still 127.9MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.66ms. Allocated memory was 127.9MB in the beginning and 163.6MB in the end (delta: 35.7MB). Free memory was 58.2MB in the beginning and 132.2MB in the end (delta: -74.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.88ms. Allocated memory is still 163.6MB. Free memory was 132.2MB in the beginning and 131.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.30ms. Allocated memory is still 163.6MB. Free memory was 131.1MB in the beginning and 128.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.93ms. Allocated memory is still 163.6MB. Free memory was 128.9MB in the beginning and 111.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 6270.95ms. Allocated memory was 163.6MB in the beginning and 838.9MB in the end (delta: 675.3MB). Free memory was 111.2MB in the beginning and 472.8MB in the end (delta: -361.6MB). Peak memory consumption was 314.7MB. Max. memory is 16.1GB. * Witness Printer took 48.00ms. Allocated memory is still 838.9MB. Free memory was 472.8MB in the beginning and 469.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 39938 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 3.9s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 2.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.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, 549 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 1760 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 678 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 1082 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 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: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND TRUE p2 != 0 [L93] lk2 = 1 [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND TRUE p14 != 0 [L141] lk14 = 1 [L146] COND FALSE !(p1 != 0) [L151] COND TRUE p2 != 0 [L152] COND FALSE !(lk2 != 1) [L153] lk2 = 0 [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND TRUE p14 != 0 [L212] COND FALSE !(lk14 != 1) [L213] lk14 = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:32:30,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)