./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:26:21,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:26:21,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:26:21,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:26:21,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:26:21,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:26:21,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:26:21,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:26:21,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:26:21,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:26:21,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:26:21,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:26:21,844 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:26:21,844 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:26:21,846 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:26:21,846 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:26:21,846 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:26:21,847 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:26:21,847 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:26:21,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:26:21,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:26:21,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:26:21,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:26:21,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:26:21,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:26:21,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:26:21,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:26:21,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:26:21,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:26:21,849 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:26:21,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:26:21,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:26:21,850 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:26:21,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:26:21,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:26:21,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:26:21,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:26:21,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:26:21,851 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:26:21,851 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-clean/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-clean/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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2024-10-12 00:26:22,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:26:22,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:26:22,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:26:22,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:26:22,122 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:26:22,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-10-12 00:26:23,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:26:23,510 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:26:23,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2024-10-12 00:26:23,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b48e0489/e62a9431cdef4abba7ec977ff546c80d/FLAG600e571b1 [2024-10-12 00:26:23,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b48e0489/e62a9431cdef4abba7ec977ff546c80d [2024-10-12 00:26:23,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:26:23,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:26:23,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:23,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:26:23,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:26:23,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33849365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23, skipping insertion in model container [2024-10-12 00:26:23,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,559 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:26:23,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:23,720 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:26:23,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:23,755 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:26:23,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23 WrapperNode [2024-10-12 00:26:23,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:23,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:23,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:26:23,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:26:23,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,792 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 182 [2024-10-12 00:26:23,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:23,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:26:23,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:26:23,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:26:23,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,812 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-10-12 00:26:23,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:26:23,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:26:23,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:26:23,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:26:23,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (1/1) ... [2024-10-12 00:26:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:23,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:23,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:26:23,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:26:23,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:26:23,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:26:23,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:26:23,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:26:23,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:26:24,165 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-12 00:26:24,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:26:24,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:26:24,179 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:26:24,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:24 BoogieIcfgContainer [2024-10-12 00:26:24,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:26:24,180 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:26:24,181 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:26:24,184 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:26:24,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:24,184 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:26:23" (1/3) ... [2024-10-12 00:26:24,185 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c46e914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:24, skipping insertion in model container [2024-10-12 00:26:24,185 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:24,185 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:23" (2/3) ... [2024-10-12 00:26:24,186 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c46e914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:24, skipping insertion in model container [2024-10-12 00:26:24,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:24,186 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:24" (3/3) ... [2024-10-12 00:26:24,187 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2024-10-12 00:26:24,255 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:26:24,255 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:26:24,255 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:26:24,255 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:26:24,256 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:26:24,256 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:26:24,256 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:26:24,256 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:26:24,284 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-10-12 00:26:24,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-10-12 00:26:24,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:24,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:24,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:24,323 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] [2024-10-12 00:26:24,323 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:26:24,324 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-10-12 00:26:24,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2024-10-12 00:26:24,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:24,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:24,328 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:24,329 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] [2024-10-12 00:26:24,336 INFO L745 eck$LassoCheckResult]: Stem: 25#$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); 34#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; 36#L211-1true [2024-10-12 00:26:24,337 INFO L747 eck$LassoCheckResult]: Loop: 36#L211-1true 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; 21#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; 32#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; 26#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; 33#L124-1true assume !(0 != main_~p11~0#1); 15#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); 16#L146-1true assume !(0 != main_~p2~0#1); 30#L151-1true assume !(0 != main_~p3~0#1); 28#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); 23#L171-1true assume !(0 != main_~p7~0#1); 19#L176-1true assume !(0 != main_~p8~0#1); 50#L181-1true assume !(0 != main_~p9~0#1); 20#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); 24#L201-1true assume !(0 != main_~p13~0#1); 13#L206-1true assume !(0 != main_~p14~0#1); 36#L211-1true [2024-10-12 00:26:24,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:26:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718959722] [2024-10-12 00:26:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2024-10-12 00:26:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265209151] [2024-10-12 00:26:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265209151] [2024-10-12 00:26:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265209151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:24,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:24,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907419098] [2024-10-12 00:26:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:24,591 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:24,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:24,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:24,617 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.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:24,651 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2024-10-12 00:26:24,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 177 transitions. [2024-10-12 00:26:24,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-10-12 00:26:24,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 89 states and 143 transitions. [2024-10-12 00:26:24,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2024-10-12 00:26:24,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2024-10-12 00:26:24,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2024-10-12 00:26:24,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:24,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2024-10-12 00:26:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2024-10-12 00:26:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-12 00:26:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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-10-12 00:26:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2024-10-12 00:26:24,694 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2024-10-12 00:26:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:24,698 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2024-10-12 00:26:24,699 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:26:24,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2024-10-12 00:26:24,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2024-10-12 00:26:24,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:24,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:24,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:24,703 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] [2024-10-12 00:26:24,703 INFO L745 eck$LassoCheckResult]: Stem: 205#$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); 173#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; 174#L211-1 [2024-10-12 00:26:24,703 INFO L747 eck$LassoCheckResult]: Loop: 174#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 220#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; 219#L88 assume !(0 != main_~p1~0#1); 184#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 160#L92-1 assume !(0 != main_~p3~0#1); 158#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 159#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 168#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; 206#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; 171#L124-1 assume !(0 != main_~p11~0#1); 172#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 191#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 214#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 213#L140-1 assume !(0 != main_~p1~0#1); 194#L146-1 assume !(0 != main_~p2~0#1); 196#L151-1 assume !(0 != main_~p3~0#1); 170#L156-1 assume !(0 != main_~p4~0#1); 161#L161-1 assume !(0 != main_~p5~0#1); 163#L166-1 assume !(0 != main_~p6~0#1); 178#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); 193#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 224#L201-1 assume !(0 != main_~p13~0#1); 222#L206-1 assume !(0 != main_~p14~0#1); 174#L211-1 [2024-10-12 00:26:24,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:26:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388104089] [2024-10-12 00:26:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2024-10-12 00:26:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844294226] [2024-10-12 00:26:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:24,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844294226] [2024-10-12 00:26:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844294226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219020979] [2024-10-12 00:26:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:24,795 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:24,800 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:24,822 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2024-10-12 00:26:24,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2024-10-12 00:26:24,826 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2024-10-12 00:26:24,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2024-10-12 00:26:24,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2024-10-12 00:26:24,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2024-10-12 00:26:24,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2024-10-12 00:26:24,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:24,829 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2024-10-12 00:26:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2024-10-12 00:26:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-10-12 00:26:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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-10-12 00:26:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2024-10-12 00:26:24,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2024-10-12 00:26:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:24,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2024-10-12 00:26:24,840 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:26:24,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2024-10-12 00:26:24,842 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2024-10-12 00:26:24,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:24,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:24,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:24,842 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] [2024-10-12 00:26:24,842 INFO L745 eck$LassoCheckResult]: Stem: 481#$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-1 [2024-10-12 00:26:24,843 INFO L747 eck$LassoCheckResult]: Loop: 444#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 505#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; 503#L88 assume !(0 != main_~p1~0#1); 501#L88-2 assume !(0 != main_~p2~0#1); 498#L92-1 assume !(0 != main_~p3~0#1); 497#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 435#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 436#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 456#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 457#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 480#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 453#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 441#L124-1 assume !(0 != main_~p11~0#1); 442#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 463#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 488#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 486#L140-1 assume !(0 != main_~p1~0#1); 487#L146-1 assume !(0 != main_~p2~0#1); 485#L151-1 assume !(0 != main_~p3~0#1); 438#L156-1 assume !(0 != main_~p4~0#1); 430#L161-1 assume !(0 != main_~p5~0#1); 432#L166-1 assume !(0 != main_~p6~0#1); 446#L171-1 assume !(0 != main_~p7~0#1); 532#L176-1 assume !(0 != main_~p8~0#1); 530#L181-1 assume !(0 != main_~p9~0#1); 525#L186-1 assume !(0 != main_~p10~0#1); 522#L191-1 assume !(0 != main_~p11~0#1); 518#L196-1 assume !(0 != main_~p12~0#1); 514#L201-1 assume !(0 != main_~p13~0#1); 510#L206-1 assume !(0 != main_~p14~0#1); 444#L211-1 [2024-10-12 00:26:24,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:26:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550696108] [2024-10-12 00:26:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2024-10-12 00:26:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990652057] [2024-10-12 00:26:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990652057] [2024-10-12 00:26:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990652057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363671546] [2024-10-12 00:26:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:24,914 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:24,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:24,916 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:24,929 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2024-10-12 00:26:24,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2024-10-12 00:26:24,932 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2024-10-12 00:26:24,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2024-10-12 00:26:24,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2024-10-12 00:26:24,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2024-10-12 00:26:24,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2024-10-12 00:26:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:24,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2024-10-12 00:26:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2024-10-12 00:26:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-10-12 00:26:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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-10-12 00:26:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2024-10-12 00:26:24,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2024-10-12 00:26:24,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:24,958 INFO L425 stractBuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2024-10-12 00:26:24,958 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:26:24,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2024-10-12 00:26:24,960 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2024-10-12 00:26:24,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:24,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:24,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:24,961 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] [2024-10-12 00:26:24,961 INFO L745 eck$LassoCheckResult]: Stem: 1001#$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-1 [2024-10-12 00:26:24,961 INFO L747 eck$LassoCheckResult]: Loop: 966#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1131#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; 1121#L88 assume !(0 != main_~p1~0#1); 1122#L88-2 assume !(0 != main_~p2~0#1); 1234#L92-1 assume !(0 != main_~p3~0#1); 1237#L96-1 assume !(0 != main_~p4~0#1); 1238#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1284#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1206#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1203#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1200#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1199#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1198#L124-1 assume !(0 != main_~p11~0#1); 1197#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1196#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1195#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1193#L140-1 assume !(0 != main_~p1~0#1); 1194#L146-1 assume !(0 != main_~p2~0#1); 1205#L151-1 assume !(0 != main_~p3~0#1); 1202#L156-1 assume !(0 != main_~p4~0#1); 952#L161-1 assume !(0 != main_~p5~0#1); 954#L166-1 assume !(0 != main_~p6~0#1); 968#L171-1 assume !(0 != main_~p7~0#1); 989#L176-1 assume !(0 != main_~p8~0#1); 1155#L181-1 assume !(0 != main_~p9~0#1); 1152#L186-1 assume !(0 != main_~p10~0#1); 1151#L191-1 assume !(0 != main_~p11~0#1); 1147#L196-1 assume !(0 != main_~p12~0#1); 1143#L201-1 assume !(0 != main_~p13~0#1); 1141#L206-1 assume !(0 != main_~p14~0#1); 966#L211-1 [2024-10-12 00:26:24,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:26:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858298533] [2024-10-12 00:26:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2024-10-12 00:26:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906445186] [2024-10-12 00:26:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906445186] [2024-10-12 00:26:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906445186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:25,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:25,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098340724] [2024-10-12 00:26:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:25,008 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:25,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:25,008 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:25,024 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2024-10-12 00:26:25,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2024-10-12 00:26:25,029 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2024-10-12 00:26:25,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2024-10-12 00:26:25,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2024-10-12 00:26:25,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2024-10-12 00:26:25,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2024-10-12 00:26:25,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:25,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2024-10-12 00:26:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2024-10-12 00:26:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2024-10-12 00:26:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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-10-12 00:26:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2024-10-12 00:26:25,062 INFO L240 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2024-10-12 00:26:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:25,063 INFO L425 stractBuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2024-10-12 00:26:25,064 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:26:25,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2024-10-12 00:26:25,069 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2024-10-12 00:26:25,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:25,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:25,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:25,072 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] [2024-10-12 00:26:25,072 INFO L745 eck$LassoCheckResult]: Stem: 2019#$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); 1985#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; 1986#L211-1 [2024-10-12 00:26:25,073 INFO L747 eck$LassoCheckResult]: Loop: 1986#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2078#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; 2052#L88 assume !(0 != main_~p1~0#1); 2053#L88-2 assume !(0 != main_~p2~0#1); 2294#L92-1 assume !(0 != main_~p3~0#1); 2290#L96-1 assume !(0 != main_~p4~0#1); 2285#L100-1 assume !(0 != main_~p5~0#1); 2284#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2283#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2269#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2267#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2264#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2265#L124-1 assume !(0 != main_~p11~0#1); 2268#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2266#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2263#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2261#L140-1 assume !(0 != main_~p1~0#1); 2259#L146-1 assume !(0 != main_~p2~0#1); 2257#L151-1 assume !(0 != main_~p3~0#1); 2254#L156-1 assume !(0 != main_~p4~0#1); 2250#L161-1 assume !(0 != main_~p5~0#1); 2243#L166-1 assume !(0 != main_~p6~0#1); 2233#L171-1 assume !(0 != main_~p7~0#1); 2206#L176-1 assume !(0 != main_~p8~0#1); 2202#L181-1 assume !(0 != main_~p9~0#1); 2199#L186-1 assume !(0 != main_~p10~0#1); 2198#L191-1 assume !(0 != main_~p11~0#1); 2196#L196-1 assume !(0 != main_~p12~0#1); 2192#L201-1 assume !(0 != main_~p13~0#1); 2083#L206-1 assume !(0 != main_~p14~0#1); 1986#L211-1 [2024-10-12 00:26:25,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,073 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-12 00:26:25,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198877217] [2024-10-12 00:26:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:25,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2024-10-12 00:26:25,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810923354] [2024-10-12 00:26:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:25,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810923354] [2024-10-12 00:26:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810923354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623188775] [2024-10-12 00:26:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:25,136 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:25,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:25,137 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:25,157 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2024-10-12 00:26:25,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2024-10-12 00:26:25,166 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2024-10-12 00:26:25,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2024-10-12 00:26:25,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2024-10-12 00:26:25,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2024-10-12 00:26:25,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2024-10-12 00:26:25,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:25,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2024-10-12 00:26:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2024-10-12 00:26:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2024-10-12 00:26:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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-10-12 00:26:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2024-10-12 00:26:25,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2024-10-12 00:26:25,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:25,235 INFO L425 stractBuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2024-10-12 00:26:25,235 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:26:25,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2024-10-12 00:26:25,246 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2024-10-12 00:26:25,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:25,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:25,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:25,248 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] [2024-10-12 00:26:25,248 INFO L745 eck$LassoCheckResult]: Stem: 4036#$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-1 [2024-10-12 00:26:25,248 INFO L747 eck$LassoCheckResult]: Loop: 3998#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4125#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; 4078#L88 assume !(0 != main_~p1~0#1); 4061#L88-2 assume !(0 != main_~p2~0#1); 4063#L92-1 assume !(0 != main_~p3~0#1); 4368#L96-1 assume !(0 != main_~p4~0#1); 4364#L100-1 assume !(0 != main_~p5~0#1); 4208#L104-1 assume !(0 != main_~p6~0#1); 4210#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4200#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4201#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4192#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4193#L124-1 assume !(0 != main_~p11~0#1); 4184#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4185#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4176#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4177#L140-1 assume !(0 != main_~p1~0#1); 4333#L146-1 assume !(0 != main_~p2~0#1); 4332#L151-1 assume !(0 != main_~p3~0#1); 4329#L156-1 assume !(0 != main_~p4~0#1); 4327#L161-1 assume !(0 != main_~p5~0#1); 4325#L166-1 assume !(0 != main_~p6~0#1); 4323#L171-1 assume !(0 != main_~p7~0#1); 4322#L176-1 assume !(0 != main_~p8~0#1); 4316#L181-1 assume !(0 != main_~p9~0#1); 4312#L186-1 assume !(0 != main_~p10~0#1); 4310#L191-1 assume !(0 != main_~p11~0#1); 4307#L196-1 assume !(0 != main_~p12~0#1); 4304#L201-1 assume !(0 != main_~p13~0#1); 4301#L206-1 assume !(0 != main_~p14~0#1); 3998#L211-1 [2024-10-12 00:26:25,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-12 00:26:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965546098] [2024-10-12 00:26:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:25,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,284 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2024-10-12 00:26:25,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400117977] [2024-10-12 00:26:25,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400117977] [2024-10-12 00:26:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400117977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:25,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:25,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890989953] [2024-10-12 00:26:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:25,311 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:25,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:25,312 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:25,335 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2024-10-12 00:26:25,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2024-10-12 00:26:25,359 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2024-10-12 00:26:25,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2024-10-12 00:26:25,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2024-10-12 00:26:25,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2024-10-12 00:26:25,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2024-10-12 00:26:25,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:25,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2024-10-12 00:26:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2024-10-12 00:26:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2024-10-12 00:26:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 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-10-12 00:26:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2024-10-12 00:26:25,413 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2024-10-12 00:26:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:25,415 INFO L425 stractBuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2024-10-12 00:26:25,415 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:26:25,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2024-10-12 00:26:25,425 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2024-10-12 00:26:25,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:25,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:25,426 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:25,426 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] [2024-10-12 00:26:25,427 INFO L745 eck$LassoCheckResult]: Stem: 7997#$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); 7958#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; 7959#L211-1 [2024-10-12 00:26:25,427 INFO L747 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8292#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; 8289#L88 assume !(0 != main_~p1~0#1); 8285#L88-2 assume !(0 != main_~p2~0#1); 8282#L92-1 assume !(0 != main_~p3~0#1); 8279#L96-1 assume !(0 != main_~p4~0#1); 8280#L100-1 assume !(0 != main_~p5~0#1); 8364#L104-1 assume !(0 != main_~p6~0#1); 8361#L108-1 assume !(0 != main_~p7~0#1); 8359#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8357#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8355#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8353#L124-1 assume !(0 != main_~p11~0#1); 8351#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8349#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8347#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8343#L140-1 assume !(0 != main_~p1~0#1); 8339#L146-1 assume !(0 != main_~p2~0#1); 8336#L151-1 assume !(0 != main_~p3~0#1); 8332#L156-1 assume !(0 != main_~p4~0#1); 8330#L161-1 assume !(0 != main_~p5~0#1); 8328#L166-1 assume !(0 != main_~p6~0#1); 8324#L171-1 assume !(0 != main_~p7~0#1); 8321#L176-1 assume !(0 != main_~p8~0#1); 8317#L181-1 assume !(0 != main_~p9~0#1); 8312#L186-1 assume !(0 != main_~p10~0#1); 8309#L191-1 assume !(0 != main_~p11~0#1); 8305#L196-1 assume !(0 != main_~p12~0#1); 8301#L201-1 assume !(0 != main_~p13~0#1); 8297#L206-1 assume !(0 != main_~p14~0#1); 7959#L211-1 [2024-10-12 00:26:25,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,427 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-12 00:26:25,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694186878] [2024-10-12 00:26:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:25,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2024-10-12 00:26:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477287963] [2024-10-12 00:26:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477287963] [2024-10-12 00:26:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477287963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:25,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134822] [2024-10-12 00:26:25,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:25,458 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:25,459 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:25,482 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2024-10-12 00:26:25,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2024-10-12 00:26:25,509 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2024-10-12 00:26:25,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2024-10-12 00:26:25,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2024-10-12 00:26:25,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2024-10-12 00:26:25,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2024-10-12 00:26:25,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:25,540 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2024-10-12 00:26:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2024-10-12 00:26:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2024-10-12 00:26:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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-10-12 00:26:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2024-10-12 00:26:25,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2024-10-12 00:26:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:25,670 INFO L425 stractBuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2024-10-12 00:26:25,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:26:25,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2024-10-12 00:26:25,690 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2024-10-12 00:26:25,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:25,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:25,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:25,692 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] [2024-10-12 00:26:25,692 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); 15777#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; 15778#L211-1 [2024-10-12 00:26:25,692 INFO L747 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16220#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; 16217#L88 assume !(0 != main_~p1~0#1); 16213#L88-2 assume !(0 != main_~p2~0#1); 16210#L92-1 assume !(0 != main_~p3~0#1); 16205#L96-1 assume !(0 != main_~p4~0#1); 16206#L100-1 assume !(0 != main_~p5~0#1); 16270#L104-1 assume !(0 != main_~p6~0#1); 16268#L108-1 assume !(0 != main_~p7~0#1); 16266#L112-1 assume !(0 != main_~p8~0#1); 16265#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16264#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16263#L124-1 assume !(0 != main_~p11~0#1); 16262#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16261#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16260#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16258#L140-1 assume !(0 != main_~p1~0#1); 16256#L146-1 assume !(0 != main_~p2~0#1); 16255#L151-1 assume !(0 != main_~p3~0#1); 16126#L156-1 assume !(0 != main_~p4~0#1); 16127#L161-1 assume !(0 != main_~p5~0#1); 16120#L166-1 assume !(0 != main_~p6~0#1); 16121#L171-1 assume !(0 != main_~p7~0#1); 16248#L176-1 assume !(0 != main_~p8~0#1); 16245#L181-1 assume !(0 != main_~p9~0#1); 16240#L186-1 assume !(0 != main_~p10~0#1); 16237#L191-1 assume !(0 != main_~p11~0#1); 16233#L196-1 assume !(0 != main_~p12~0#1); 16229#L201-1 assume !(0 != main_~p13~0#1); 16225#L206-1 assume !(0 != main_~p14~0#1); 15778#L211-1 [2024-10-12 00:26:25,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,692 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-12 00:26:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26922100] [2024-10-12 00:26:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:25,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2024-10-12 00:26:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11106060] [2024-10-12 00:26:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:25,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11106060] [2024-10-12 00:26:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11106060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270213079] [2024-10-12 00:26:25,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:25,730 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:25,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:25,733 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:25,771 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2024-10-12 00:26:25,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2024-10-12 00:26:25,820 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2024-10-12 00:26:25,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2024-10-12 00:26:25,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2024-10-12 00:26:25,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2024-10-12 00:26:25,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2024-10-12 00:26:25,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:25,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2024-10-12 00:26:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2024-10-12 00:26:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2024-10-12 00:26:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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-10-12 00:26:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2024-10-12 00:26:26,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2024-10-12 00:26:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:26,132 INFO L425 stractBuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2024-10-12 00:26:26,132 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:26:26,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2024-10-12 00:26:26,165 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2024-10-12 00:26:26,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:26,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:26,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:26,166 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] [2024-10-12 00:26:26,167 INFO L745 eck$LassoCheckResult]: Stem: 31245#$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); 31211#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; 31212#L211-1 [2024-10-12 00:26:26,168 INFO L747 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31551#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; 31552#L88 assume !(0 != main_~p1~0#1); 31571#L88-2 assume !(0 != main_~p2~0#1); 31569#L92-1 assume !(0 != main_~p3~0#1); 31566#L96-1 assume !(0 != main_~p4~0#1); 31562#L100-1 assume !(0 != main_~p5~0#1); 31558#L104-1 assume !(0 != main_~p6~0#1); 31555#L108-1 assume !(0 != main_~p7~0#1); 31509#L112-1 assume !(0 != main_~p8~0#1); 31511#L116-1 assume !(0 != main_~p9~0#1); 31491#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 31492#L124-1 assume !(0 != main_~p11~0#1); 31475#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31476#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31459#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31460#L140-1 assume !(0 != main_~p1~0#1); 31443#L146-1 assume !(0 != main_~p2~0#1); 31445#L151-1 assume !(0 != main_~p3~0#1); 31417#L156-1 assume !(0 != main_~p4~0#1); 31419#L161-1 assume !(0 != main_~p5~0#1); 31393#L166-1 assume !(0 != main_~p6~0#1); 31394#L171-1 assume !(0 != main_~p7~0#1); 31599#L176-1 assume !(0 != main_~p8~0#1); 31595#L181-1 assume !(0 != main_~p9~0#1); 31591#L186-1 assume !(0 != main_~p10~0#1); 31588#L191-1 assume !(0 != main_~p11~0#1); 31584#L196-1 assume !(0 != main_~p12~0#1); 31580#L201-1 assume !(0 != main_~p13~0#1); 31576#L206-1 assume !(0 != main_~p14~0#1); 31212#L211-1 [2024-10-12 00:26:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-10-12 00:26:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333112073] [2024-10-12 00:26:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:26,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:26,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:26,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2024-10-12 00:26:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097908330] [2024-10-12 00:26:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097908330] [2024-10-12 00:26:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097908330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:26,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:26,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496276201] [2024-10-12 00:26:26,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:26,209 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:26,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:26,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:26,210 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:26,271 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2024-10-12 00:26:26,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2024-10-12 00:26:26,396 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2024-10-12 00:26:26,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2024-10-12 00:26:26,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2024-10-12 00:26:26,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2024-10-12 00:26:26,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2024-10-12 00:26:26,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:26,539 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2024-10-12 00:26:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2024-10-12 00:26:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2024-10-12 00:26:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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-10-12 00:26:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2024-10-12 00:26:27,030 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2024-10-12 00:26:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:27,033 INFO L425 stractBuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2024-10-12 00:26:27,033 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:26:27,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2024-10-12 00:26:27,093 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2024-10-12 00:26:27,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:27,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:27,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:27,094 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] [2024-10-12 00:26:27,094 INFO L745 eck$LassoCheckResult]: Stem: 61721#$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); 61684#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; 61685#L211-1 [2024-10-12 00:26:27,094 INFO L747 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62230#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; 62226#L88 assume !(0 != main_~p1~0#1); 62218#L88-2 assume !(0 != main_~p2~0#1); 62220#L92-1 assume !(0 != main_~p3~0#1); 62209#L96-1 assume !(0 != main_~p4~0#1); 62210#L100-1 assume !(0 != main_~p5~0#1); 62371#L104-1 assume !(0 != main_~p6~0#1); 62365#L108-1 assume !(0 != main_~p7~0#1); 62359#L112-1 assume !(0 != main_~p8~0#1); 62354#L116-1 assume !(0 != main_~p9~0#1); 62348#L120-1 assume !(0 != main_~p10~0#1); 62343#L124-1 assume !(0 != main_~p11~0#1); 62340#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 62338#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62334#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62329#L140-1 assume !(0 != main_~p1~0#1); 62324#L146-1 assume !(0 != main_~p2~0#1); 62319#L151-1 assume !(0 != main_~p3~0#1); 62312#L156-1 assume !(0 != main_~p4~0#1); 62307#L161-1 assume !(0 != main_~p5~0#1); 62302#L166-1 assume !(0 != main_~p6~0#1); 62298#L171-1 assume !(0 != main_~p7~0#1); 62292#L176-1 assume !(0 != main_~p8~0#1); 62286#L181-1 assume !(0 != main_~p9~0#1); 62280#L186-1 assume !(0 != main_~p10~0#1); 62275#L191-1 assume !(0 != main_~p11~0#1); 62269#L196-1 assume !(0 != main_~p12~0#1); 62265#L201-1 assume !(0 != main_~p13~0#1); 62241#L206-1 assume !(0 != main_~p14~0#1); 61685#L211-1 [2024-10-12 00:26:27,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-10-12 00:26:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88577046] [2024-10-12 00:26:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:27,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:27,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:27,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2024-10-12 00:26:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854531284] [2024-10-12 00:26:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854531284] [2024-10-12 00:26:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854531284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:27,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:27,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652455359] [2024-10-12 00:26:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:27,130 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:27,131 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:27,304 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2024-10-12 00:26:27,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2024-10-12 00:26:27,543 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2024-10-12 00:26:27,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2024-10-12 00:26:27,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2024-10-12 00:26:27,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2024-10-12 00:26:27,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2024-10-12 00:26:27,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:27,709 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2024-10-12 00:26:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2024-10-12 00:26:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2024-10-12 00:26:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 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-10-12 00:26:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2024-10-12 00:26:28,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2024-10-12 00:26:28,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:28,235 INFO L425 stractBuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2024-10-12 00:26:28,235 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-12 00:26:28,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2024-10-12 00:26:28,515 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2024-10-12 00:26:28,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:28,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:28,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:28,516 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] [2024-10-12 00:26:28,517 INFO L745 eck$LassoCheckResult]: Stem: 121887#$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-1 [2024-10-12 00:26:28,517 INFO L747 eck$LassoCheckResult]: Loop: 121855#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122666#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; 122661#L88 assume !(0 != main_~p1~0#1); 122654#L88-2 assume !(0 != main_~p2~0#1); 122649#L92-1 assume !(0 != main_~p3~0#1); 122642#L96-1 assume !(0 != main_~p4~0#1); 122634#L100-1 assume !(0 != main_~p5~0#1); 122626#L104-1 assume !(0 != main_~p6~0#1); 122620#L108-1 assume !(0 != main_~p7~0#1); 122612#L112-1 assume !(0 != main_~p8~0#1); 122614#L116-1 assume !(0 != main_~p9~0#1); 122603#L120-1 assume !(0 != main_~p10~0#1); 122604#L124-1 assume !(0 != main_~p11~0#1); 122586#L128-1 assume !(0 != main_~p12~0#1); 122588#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 122539#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 122540#L140-1 assume !(0 != main_~p1~0#1); 122727#L146-1 assume !(0 != main_~p2~0#1); 122724#L151-1 assume !(0 != main_~p3~0#1); 122720#L156-1 assume !(0 != main_~p4~0#1); 122719#L161-1 assume !(0 != main_~p5~0#1); 122709#L166-1 assume !(0 != main_~p6~0#1); 122705#L171-1 assume !(0 != main_~p7~0#1); 122701#L176-1 assume !(0 != main_~p8~0#1); 122697#L181-1 assume !(0 != main_~p9~0#1); 122694#L186-1 assume !(0 != main_~p10~0#1); 122691#L191-1 assume !(0 != main_~p11~0#1); 122684#L196-1 assume !(0 != main_~p12~0#1); 122679#L201-1 assume !(0 != main_~p13~0#1); 122673#L206-1 assume !(0 != main_~p14~0#1); 121855#L211-1 [2024-10-12 00:26:28,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-10-12 00:26:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023149820] [2024-10-12 00:26:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:28,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:28,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2024-10-12 00:26:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429919250] [2024-10-12 00:26:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429919250] [2024-10-12 00:26:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429919250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:28,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933663167] [2024-10-12 00:26:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:28,550 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:28,550 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:28,713 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2024-10-12 00:26:28,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2024-10-12 00:26:29,287 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2024-10-12 00:26:29,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2024-10-12 00:26:29,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2024-10-12 00:26:29,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2024-10-12 00:26:29,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2024-10-12 00:26:29,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:29,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2024-10-12 00:26:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2024-10-12 00:26:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2024-10-12 00:26:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 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-10-12 00:26:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2024-10-12 00:26:30,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2024-10-12 00:26:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:30,755 INFO L425 stractBuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2024-10-12 00:26:30,755 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-12 00:26:30,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2024-10-12 00:26:31,165 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2024-10-12 00:26:31,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:31,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:31,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:31,167 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] [2024-10-12 00:26:31,167 INFO L745 eck$LassoCheckResult]: Stem: 240689#$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); 240647#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; 240648#L211-1 [2024-10-12 00:26:31,167 INFO L747 eck$LassoCheckResult]: Loop: 240648#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 240853#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; 240849#L88 assume !(0 != main_~p1~0#1); 240842#L88-2 assume !(0 != main_~p2~0#1); 240837#L92-1 assume !(0 != main_~p3~0#1); 240830#L96-1 assume !(0 != main_~p4~0#1); 240822#L100-1 assume !(0 != main_~p5~0#1); 240814#L104-1 assume !(0 != main_~p6~0#1); 240806#L108-1 assume !(0 != main_~p7~0#1); 240798#L112-1 assume !(0 != main_~p8~0#1); 240790#L116-1 assume !(0 != main_~p9~0#1); 240782#L120-1 assume !(0 != main_~p10~0#1); 240777#L124-1 assume !(0 != main_~p11~0#1); 240770#L128-1 assume !(0 != main_~p12~0#1); 240764#L132-1 assume !(0 != main_~p13~0#1); 240758#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 240759#L140-1 assume !(0 != main_~p1~0#1); 240748#L146-1 assume !(0 != main_~p2~0#1); 240750#L151-1 assume !(0 != main_~p3~0#1); 240950#L156-1 assume !(0 != main_~p4~0#1); 240946#L161-1 assume !(0 != main_~p5~0#1); 240942#L166-1 assume !(0 != main_~p6~0#1); 240938#L171-1 assume !(0 != main_~p7~0#1); 240934#L176-1 assume !(0 != main_~p8~0#1); 240930#L181-1 assume !(0 != main_~p9~0#1); 240885#L186-1 assume !(0 != main_~p10~0#1); 240882#L191-1 assume !(0 != main_~p11~0#1); 240874#L196-1 assume !(0 != main_~p12~0#1); 240869#L201-1 assume !(0 != main_~p13~0#1); 240862#L206-1 assume !(0 != main_~p14~0#1); 240648#L211-1 [2024-10-12 00:26:31,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-10-12 00:26:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:31,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701829509] [2024-10-12 00:26:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:31,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:31,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:31,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2024-10-12 00:26:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911918268] [2024-10-12 00:26:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911918268] [2024-10-12 00:26:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911918268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:31,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:26:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459340285] [2024-10-12 00:26:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:31,197 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:31,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:31,198 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-12 00:26:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:31,630 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2024-10-12 00:26:31,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2024-10-12 00:26:32,527 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2024-10-12 00:26:33,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2024-10-12 00:26:33,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2024-10-12 00:26:33,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2024-10-12 00:26:33,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2024-10-12 00:26:33,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:33,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2024-10-12 00:26:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2024-10-12 00:26:34,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2024-10-12 00:26:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 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-10-12 00:26:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2024-10-12 00:26:35,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2024-10-12 00:26:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:35,028 INFO L425 stractBuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2024-10-12 00:26:35,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-12 00:26:35,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2024-10-12 00:26:36,085 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2024-10-12 00:26:36,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:36,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:36,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:36,087 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] [2024-10-12 00:26:36,092 INFO L745 eck$LassoCheckResult]: Stem: 475195#$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); 475155#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; 475156#L211-1 [2024-10-12 00:26:36,092 INFO L747 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;havoc main_#t~nondet18#1;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 475827#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; 475790#L88 assume !(0 != main_~p1~0#1); 475783#L88-2 assume !(0 != main_~p2~0#1); 475777#L92-1 assume !(0 != main_~p3~0#1); 475772#L96-1 assume !(0 != main_~p4~0#1); 475765#L100-1 assume !(0 != main_~p5~0#1); 475758#L104-1 assume !(0 != main_~p6~0#1); 475751#L108-1 assume !(0 != main_~p7~0#1); 475743#L112-1 assume !(0 != main_~p8~0#1); 475745#L116-1 assume !(0 != main_~p9~0#1); 475914#L120-1 assume !(0 != main_~p10~0#1); 475911#L124-1 assume !(0 != main_~p11~0#1); 475908#L128-1 assume !(0 != main_~p12~0#1); 475904#L132-1 assume !(0 != main_~p13~0#1); 475895#L136-1 assume !(0 != main_~p14~0#1); 475896#L140-1 assume !(0 != main_~p1~0#1); 475952#L146-1 assume !(0 != main_~p2~0#1); 475973#L151-1 assume !(0 != main_~p3~0#1); 475970#L156-1 assume !(0 != main_~p4~0#1); 475968#L161-1 assume !(0 != main_~p5~0#1); 475966#L166-1 assume !(0 != main_~p6~0#1); 475964#L171-1 assume !(0 != main_~p7~0#1); 475962#L176-1 assume !(0 != main_~p8~0#1); 475960#L181-1 assume !(0 != main_~p9~0#1); 475958#L186-1 assume !(0 != main_~p10~0#1); 475957#L191-1 assume !(0 != main_~p11~0#1); 475954#L196-1 assume !(0 != main_~p12~0#1); 475634#L201-1 assume !(0 != main_~p13~0#1); 475635#L206-1 assume !(0 != main_~p14~0#1); 475156#L211-1 [2024-10-12 00:26:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2024-10-12 00:26:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397141518] [2024-10-12 00:26:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2024-10-12 00:26:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404576828] [2024-10-12 00:26:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2024-10-12 00:26:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:36,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845787888] [2024-10-12 00:26:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:36,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:26:36 BoogieIcfgContainer [2024-10-12 00:26:36,607 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:26:36,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:26:36,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:26:36,609 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:26:36,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:24" (3/4) ... [2024-10-12 00:26:36,610 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:26:36,652 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:26:36,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:26:36,652 INFO L158 Benchmark]: Toolchain (without parser) took 13120.63ms. Allocated memory was 155.2MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 118.8MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-12 00:26:36,653 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:36,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.95ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 105.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:26:36,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.95ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:36,653 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 155.2MB. Free memory was 103.2MB in the beginning and 101.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:36,653 INFO L158 Benchmark]: RCFGBuilder took 348.32ms. Allocated memory is still 155.2MB. Free memory was 101.1MB in the beginning and 84.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 00:26:36,654 INFO L158 Benchmark]: BuchiAutomizer took 12426.80ms. Allocated memory was 155.2MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 84.3MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-12 00:26:36,654 INFO L158 Benchmark]: Witness Printer took 44.18ms. Allocated memory is still 10.5GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:36,655 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.12ms. Allocated memory is still 113.2MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.95ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 105.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.95ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 103.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 155.2MB. Free memory was 103.2MB in the beginning and 101.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.32ms. Allocated memory is still 155.2MB. Free memory was 101.1MB in the beginning and 84.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 12426.80ms. Allocated memory was 155.2MB in the beginning and 10.5GB in the end (delta: 10.4GB). Free memory was 84.3MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 44.18ms. Allocated memory is still 10.5GB. Free memory was 9.2GB in the beginning and 9.2GB 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 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 8.9s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 4.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.0s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 688 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 2155 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 832 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1323 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI12 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 FALSE !(p2 != 0) [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 FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 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 FALSE !(p14 != 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 FALSE !(p2 != 0) [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 FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 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 FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 00:26:36,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)