./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.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/openssl-simplified/s3_srvr_1b.cil.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 153b6d90c91de27e09ed3c918b0b1be779b258e790f6fc392e7d5f390719c2db --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:26:17,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:26:17,251 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:17,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:26:17,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:26:17,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:26:17,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:26:17,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:26:17,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:26:17,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:26:17,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:26:17,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:26:17,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:26:17,286 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:26:17,288 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:26:17,288 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:26:17,289 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:26:17,289 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:26:17,289 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:26:17,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:26:17,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:26:17,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:26:17,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:26:17,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:26:17,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:26:17,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:26:17,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:26:17,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:26:17,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:26:17,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:26:17,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:26:17,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:26:17,308 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:26:17,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:26:17,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:26:17,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:26:17,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:26:17,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:26:17,310 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:26:17,310 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 -> 153b6d90c91de27e09ed3c918b0b1be779b258e790f6fc392e7d5f390719c2db [2024-10-12 00:26:17,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:26:17,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:26:17,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:26:17,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:26:17,604 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:26:17,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c [2024-10-12 00:26:19,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:26:19,282 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:26:19,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1b.cil.c [2024-10-12 00:26:19,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a70d3bc5a/fe900ed3ee004ef9b69d7d51398f1c59/FLAGbe3321f9f [2024-10-12 00:26:19,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a70d3bc5a/fe900ed3ee004ef9b69d7d51398f1c59 [2024-10-12 00:26:19,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:26:19,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:26:19,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:19,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:26:19,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:26:19,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:19" (1/1) ... [2024-10-12 00:26:19,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b506264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:19, skipping insertion in model container [2024-10-12 00:26:19,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:19" (1/1) ... [2024-10-12 00:26:19,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:26:19,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:19,584 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:26:19,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:19,622 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:26:19,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:19 WrapperNode [2024-10-12 00:26:19,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:19,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:19,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:26:19,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:26:19,632 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:19" (1/1) ... [2024-10-12 00:26:19,638 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:19" (1/1) ... [2024-10-12 00:26:19,658 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-10-12 00:26:19,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:19,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:26:19,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:26:19,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:26:19,670 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:19" (1/1) ... [2024-10-12 00:26:19,671 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:19" (1/1) ... [2024-10-12 00:26:19,672 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:19" (1/1) ... [2024-10-12 00:26:19,685 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:19,686 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:19" (1/1) ... [2024-10-12 00:26:19,686 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:19" (1/1) ... [2024-10-12 00:26:19,690 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:19" (1/1) ... [2024-10-12 00:26:19,693 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:19" (1/1) ... [2024-10-12 00:26:19,694 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:19" (1/1) ... [2024-10-12 00:26:19,695 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:19" (1/1) ... [2024-10-12 00:26:19,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:26:19,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:26:19,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:26:19,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:26:19,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:19" (1/1) ... [2024-10-12 00:26:19,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:19,735 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:19,738 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:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:26:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:26:19,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:26:19,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:26:19,841 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:26:19,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:26:19,979 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-12 00:26:19,980 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:26:19,994 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:26:19,995 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:26:19,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:19 BoogieIcfgContainer [2024-10-12 00:26:19,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:26:19,997 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:26:19,998 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:26:20,002 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:26:20,003 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:20,004 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:26:19" (1/3) ... [2024-10-12 00:26:20,006 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64803114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:20, skipping insertion in model container [2024-10-12 00:26:20,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:20,006 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:19" (2/3) ... [2024-10-12 00:26:20,006 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64803114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:20, skipping insertion in model container [2024-10-12 00:26:20,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:20,006 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:19" (3/3) ... [2024-10-12 00:26:20,010 INFO L332 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2024-10-12 00:26:20,075 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:26:20,076 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:26:20,076 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:26:20,076 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:26:20,076 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:26:20,077 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:26:20,077 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:26:20,078 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:26:20,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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:20,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:26:20,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:20,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:20,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:20,110 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:26:20,110 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:26:20,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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:20,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:26:20,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:20,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:20,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:26:20,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:26:20,122 INFO L745 eck$LassoCheckResult]: Stem: 20#$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(17, 2);call #Ultimate.allocInit(12, 3); 10#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 6#$Ultimate##5true [2024-10-12 00:26:20,122 INFO L747 eck$LassoCheckResult]: Loop: 6#$Ultimate##5true assume !false; 3#L30true assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 11#L36true assume 8466 == main_~s__state~0#1; 7#$Ultimate##17true assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 17#L69-1true assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 6#$Ultimate##5true [2024-10-12 00:26:20,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:26:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:20,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677703165] [2024-10-12 00:26:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:20,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:20,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash 39284085, now seen corresponding path program 1 times [2024-10-12 00:26:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876912518] [2024-10-12 00:26:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:20,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:20,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723571, now seen corresponding path program 1 times [2024-10-12 00:26:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060701505] [2024-10-12 00:26:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:20,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:20,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:20,459 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:20,459 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:20,459 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:20,460 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:20,460 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:20,460 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,460 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:20,460 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:20,460 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration1_Loop [2024-10-12 00:26:20,461 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:20,461 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:20,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:20,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:20,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:20,573 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:20,573 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:20,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:20,578 INFO L229 MonitoredProcess]: Starting monitored process 2 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:20,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:26:20,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:20,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:20,602 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:26:20,603 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0#1=0} Honda state: {ULTIMATE.start_main_~s__hit~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:26:20,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:26:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:20,623 INFO L229 MonitoredProcess]: Starting monitored process 3 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:20,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:26:20,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:20,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:20,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:20,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:20,662 INFO L229 MonitoredProcess]: Starting monitored process 4 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:20,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:26:20,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:20,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:20,681 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:20,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:20,697 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:20,697 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:20,697 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:20,697 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:20,698 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:20,698 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,698 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:20,698 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:20,698 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration1_Loop [2024-10-12 00:26:20,698 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:20,698 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:20,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:20,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:20,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:20,780 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:20,784 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:20,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:20,788 INFO L229 MonitoredProcess]: Starting monitored process 5 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:20,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:26:20,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:20,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:20,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:20,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:20,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:20,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:20,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:20,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:20,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:26:20,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:20,826 INFO L229 MonitoredProcess]: Starting monitored process 6 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:20,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:26:20,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:20,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:20,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:20,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:20,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:20,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:20,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:20,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:20,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:20,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:20,847 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:20,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:20,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:20,855 INFO L229 MonitoredProcess]: Starting monitored process 7 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:20,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:26:20,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:20,858 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:20,858 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:20,859 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0#1) = -1*ULTIMATE.start_main_~blastFlag~0#1 + 1 Supporting invariants [] [2024-10-12 00:26:20,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:26:20,878 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:20,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:20,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:20,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:20,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:20,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:21,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:26:21,075 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:21,106 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:26:21,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:21,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) Result 51 states and 82 transitions. Complement of second has 6 states. [2024-10-12 00:26:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:26:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2024-10-12 00:26:21,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 5 letters. [2024-10-12 00:26:21,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:21,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 7 letters. Loop has 5 letters. [2024-10-12 00:26:21,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:21,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 10 letters. [2024-10-12 00:26:21,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:21,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 82 transitions. [2024-10-12 00:26:21,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:26:21,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 38 states and 59 transitions. [2024-10-12 00:26:21,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:26:21,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-12 00:26:21,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 59 transitions. [2024-10-12 00:26:21,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:21,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 59 transitions. [2024-10-12 00:26:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 59 transitions. [2024-10-12 00:26:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-12 00:26:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 35 states have internal predecessors, (57), 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:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. [2024-10-12 00:26:21,255 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 57 transitions. [2024-10-12 00:26:21,255 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 57 transitions. [2024-10-12 00:26:21,255 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:26:21,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. [2024-10-12 00:26:21,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:26:21,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:21,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:21,260 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:26:21,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-12 00:26:21,260 INFO L745 eck$LassoCheckResult]: Stem: 155#$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(17, 2);call #Ultimate.allocInit(12, 3); 147#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 148#$Ultimate##5 assume !false; 120#L30 [2024-10-12 00:26:21,260 INFO L747 eck$LassoCheckResult]: Loop: 120#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 121#L36 assume 8466 == main_~s__state~0#1; 134#$Ultimate##17 assume !(0 == main_~blastFlag~0#1); 135#L69-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 132#$Ultimate##5 assume !false; 120#L30 [2024-10-12 00:26:21,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2024-10-12 00:26:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338219067] [2024-10-12 00:26:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:21,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:21,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:21,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash 44013377, now seen corresponding path program 1 times [2024-10-12 00:26:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656911740] [2024-10-12 00:26:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:21,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:21,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 297857786, now seen corresponding path program 1 times [2024-10-12 00:26:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696046574] [2024-10-12 00:26:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:21,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696046574] [2024-10-12 00:26:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696046574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:21,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:21,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753304620] [2024-10-12 00:26:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:21,432 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:21,433 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:21,434 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:21,434 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:21,434 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:21,434 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,434 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:21,434 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:21,434 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration2_Loop [2024-10-12 00:26:21,435 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:21,435 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:21,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:21,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:21,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:21,511 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:21,511 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,514 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:26:21,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:21,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:21,542 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:26:21,542 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0#1=-1} Honda state: {ULTIMATE.start_main_~blastFlag~0#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:26:21,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:26:21,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,561 INFO L229 MonitoredProcess]: Starting monitored process 9 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:21,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:26:21,565 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:21,565 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:21,578 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:26:21,579 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0#1=0} Honda state: {ULTIMATE.start_main_~s__hit~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:26:21,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:21,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,592 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:26:21,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:21,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:21,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:26:21,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,631 INFO L229 MonitoredProcess]: Starting monitored process 11 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:21,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:26:21,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:21,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:21,654 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:21,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:26:21,670 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:21,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:21,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:21,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:21,670 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:21,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,671 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:21,671 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:21,671 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration2_Loop [2024-10-12 00:26:21,671 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:21,671 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:21,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:21,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:21,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:21,735 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:21,736 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,739 INFO L229 MonitoredProcess]: Starting monitored process 12 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:21,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:26:21,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:21,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:21,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:21,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:21,755 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:26:21,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:21,759 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 00:26:21,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:21,762 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:26:21,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:26:21,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,779 INFO L229 MonitoredProcess]: Starting monitored process 13 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:21,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:26:21,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:21,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:21,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:21,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:21,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:21,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:21,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:21,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:21,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:26:21,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:26:21,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,819 INFO L229 MonitoredProcess]: Starting monitored process 14 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:21,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:26:21,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:21,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:21,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:21,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:21,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:21,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:21,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:21,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:21,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:21,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:21,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:21,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:21,844 INFO L229 MonitoredProcess]: Starting monitored process 15 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:21,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:26:21,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:21,847 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:21,847 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:21,847 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = -1*ULTIMATE.start_main_~s__state~0#1 + 8489 Supporting invariants [] [2024-10-12 00:26:21,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:26:21,865 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:21,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:21,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:21,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:21,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:21,941 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:21,942 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:26:21,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 57 transitions. cyclomatic complexity: 23 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:21,990 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 57 transitions. cyclomatic complexity: 23. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) Result 72 states and 109 transitions. Complement of second has 7 states. [2024-10-12 00:26:21,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:26:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-12 00:26:21,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 5 letters. [2024-10-12 00:26:21,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:21,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 5 letters. [2024-10-12 00:26:21,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:21,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 10 letters. [2024-10-12 00:26:21,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:21,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 109 transitions. [2024-10-12 00:26:22,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:26:22,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 61 states and 97 transitions. [2024-10-12 00:26:22,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:26:22,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-10-12 00:26:22,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 97 transitions. [2024-10-12 00:26:22,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:22,002 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 97 transitions. [2024-10-12 00:26:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 97 transitions. [2024-10-12 00:26:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2024-10-12 00:26:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 53 states have internal predecessors, (86), 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:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 86 transitions. [2024-10-12 00:26:22,011 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 86 transitions. [2024-10-12 00:26:22,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:22,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:22,015 INFO L87 Difference]: Start difference. First operand 54 states and 86 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:22,052 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2024-10-12 00:26:22,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 128 transitions. [2024-10-12 00:26:22,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-10-12 00:26:22,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 125 transitions. [2024-10-12 00:26:22,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-12 00:26:22,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-12 00:26:22,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 125 transitions. [2024-10-12 00:26:22,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:22,058 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-10-12 00:26:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 125 transitions. [2024-10-12 00:26:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-10-12 00:26:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 84 states have internal predecessors, (123), 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:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-10-12 00:26:22,065 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-10-12 00:26:22,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:22,066 INFO L425 stractBuchiCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-10-12 00:26:22,066 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:26:22,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 123 transitions. [2024-10-12 00:26:22,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-10-12 00:26:22,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:22,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:22,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-12 00:26:22,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:26:22,069 INFO L745 eck$LassoCheckResult]: Stem: 461#$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(17, 2);call #Ultimate.allocInit(12, 3); 448#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 449#$Ultimate##5 assume !false; 421#L30 [2024-10-12 00:26:22,069 INFO L747 eck$LassoCheckResult]: Loop: 421#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 422#L36 assume !(8466 == main_~s__state~0#1); 445#L41 assume 8512 == main_~s__state~0#1; 425#main_switch_1_8512#1 havoc main_#t~nondet5#1;main_~tmp___1~0#1 := main_#t~nondet5#1; 426#L81 assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466; 433#$Ultimate##5 assume !false; 421#L30 [2024-10-12 00:26:22,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 2 times [2024-10-12 00:26:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007315188] [2024-10-12 00:26:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:22,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1365729718, now seen corresponding path program 1 times [2024-10-12 00:26:22,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:22,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665735767] [2024-10-12 00:26:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:22,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 644971805, now seen corresponding path program 1 times [2024-10-12 00:26:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903810902] [2024-10-12 00:26:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903810902] [2024-10-12 00:26:22,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903810902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:22,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6877735] [2024-10-12 00:26:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:22,186 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:22,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:22,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:22,187 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:22,187 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:22,187 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,187 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:22,187 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:22,187 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration3_Loop [2024-10-12 00:26:22,187 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:22,187 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:22,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,220 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:22,221 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:22,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,224 INFO L229 MonitoredProcess]: Starting monitored process 16 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:22,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:26:22,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:22,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:22,244 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:26:22,244 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~tmp___1~0#1=0} Honda state: {ULTIMATE.start_main_~tmp___1~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:26:22,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:22,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,262 INFO L229 MonitoredProcess]: Starting monitored process 17 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:22,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:26:22,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:22,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:22,287 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:26:22,287 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0#1=2} Honda state: {ULTIMATE.start_main_~blastFlag~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:26:22,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 00:26:22,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,308 INFO L229 MonitoredProcess]: Starting monitored process 18 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:22,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:26:22,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:22,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:22,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,338 INFO L229 MonitoredProcess]: Starting monitored process 19 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:22,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:26:22,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:22,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:22,353 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:22,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:26:22,370 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:22,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:22,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:22,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:22,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:22,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:22,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:22,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration3_Loop [2024-10-12 00:26:22,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:22,371 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:22,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,407 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:22,407 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:22,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,409 INFO L229 MonitoredProcess]: Starting monitored process 20 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:22,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:26:22,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:22,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:22,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:22,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:22,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:22,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:22,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:22,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:22,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:26:22,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:26:22,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,451 INFO L229 MonitoredProcess]: Starting monitored process 21 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:22,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:26:22,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:22,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:22,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:22,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:22,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:22,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:22,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:22,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:22,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:22,479 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:22,479 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:26:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,482 INFO L229 MonitoredProcess]: Starting monitored process 22 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:22,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:26:22,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:22,484 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:22,484 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:22,484 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = 1*ULTIMATE.start_main_~s__state~0#1 Supporting invariants [] [2024-10-12 00:26:22,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-12 00:26:22,500 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:22,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:22,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:22,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:22,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:22,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:22,562 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:22,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:26:22,563 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 123 transitions. cyclomatic complexity: 44 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:22,662 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 123 transitions. cyclomatic complexity: 44. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) Result 255 states and 373 transitions. Complement of second has 9 states. [2024-10-12 00:26:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:26:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2024-10-12 00:26:22,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 6 letters. [2024-10-12 00:26:22,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:22,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 9 letters. Loop has 6 letters. [2024-10-12 00:26:22,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:22,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 12 letters. [2024-10-12 00:26:22,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:22,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 373 transitions. [2024-10-12 00:26:22,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2024-10-12 00:26:22,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 254 states and 372 transitions. [2024-10-12 00:26:22,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2024-10-12 00:26:22,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-10-12 00:26:22,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 372 transitions. [2024-10-12 00:26:22,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:22,671 INFO L218 hiAutomatonCegarLoop]: Abstraction has 254 states and 372 transitions. [2024-10-12 00:26:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 372 transitions. [2024-10-12 00:26:22,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 199. [2024-10-12 00:26:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 198 states have internal predecessors, (289), 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:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 289 transitions. [2024-10-12 00:26:22,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 199 states and 289 transitions. [2024-10-12 00:26:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:22,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:22,694 INFO L87 Difference]: Start difference. First operand 199 states and 289 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:22,716 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2024-10-12 00:26:22,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 95 transitions. [2024-10-12 00:26:22,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-12 00:26:22,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 61 states and 90 transitions. [2024-10-12 00:26:22,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-12 00:26:22,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-12 00:26:22,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 90 transitions. [2024-10-12 00:26:22,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:22,721 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-10-12 00:26:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 90 transitions. [2024-10-12 00:26:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-12 00:26:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 60 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-10-12 00:26:22,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-10-12 00:26:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:22,728 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-10-12 00:26:22,730 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:26:22,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 90 transitions. [2024-10-12 00:26:22,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-10-12 00:26:22,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:22,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:22,732 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:22,732 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:26:22,732 INFO L745 eck$LassoCheckResult]: Stem: 1122#$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(17, 2);call #Ultimate.allocInit(12, 3); 1113#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 1114#$Ultimate##5 assume !false; 1084#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 1085#L36 assume 8466 == main_~s__state~0#1; 1112#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 1128#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 1124#$Ultimate##5 assume !false; 1123#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 1110#L36 assume !(8466 == main_~s__state~0#1); 1111#L41 [2024-10-12 00:26:22,732 INFO L747 eck$LassoCheckResult]: Loop: 1111#L41 assume 8512 == main_~s__state~0#1; 1086#main_switch_1_8512#1 havoc main_#t~nondet5#1;main_~tmp___1~0#1 := main_#t~nondet5#1; 1087#L81 assume !(0 != main_~tmp___1~0#1);main_~s__state~0#1 := 8640; 1108#$Ultimate##5 assume !false; 1142#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 1141#L36 assume !(8466 == main_~s__state~0#1); 1111#L41 [2024-10-12 00:26:22,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1523382593, now seen corresponding path program 1 times [2024-10-12 00:26:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104419293] [2024-10-12 00:26:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:22,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1623382260, now seen corresponding path program 1 times [2024-10-12 00:26:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:22,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424060074] [2024-10-12 00:26:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:22,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:22,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1141286606, now seen corresponding path program 1 times [2024-10-12 00:26:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:22,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210540342] [2024-10-12 00:26:22,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:22,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:22,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210540342] [2024-10-12 00:26:22,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210540342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:22,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:22,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647801812] [2024-10-12 00:26:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:22,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:26:22,878 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:22,878 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:22,879 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:22,879 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:22,879 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:22,879 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,879 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:22,879 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:22,880 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration4_Loop [2024-10-12 00:26:22,880 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:22,880 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:22,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,906 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:22,907 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:22,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,909 INFO L229 MonitoredProcess]: Starting monitored process 23 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:22,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:26:22,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:22,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:22,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-12 00:26:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:22,956 INFO L229 MonitoredProcess]: Starting monitored process 24 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:22,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:26:22,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:22,960 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:22,975 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:22,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:26:22,991 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:22,991 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:22,991 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:22,991 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:22,991 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:22,991 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:22,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:22,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:22,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration4_Loop [2024-10-12 00:26:22,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:22,992 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:22,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:22,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:23,026 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:23,026 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:23,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:23,032 INFO L229 MonitoredProcess]: Starting monitored process 25 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,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-12 00:26:23,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:23,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:23,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:23,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:23,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:23,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:23,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:23,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:23,054 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:23,057 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:23,058 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:23,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:23,060 INFO L229 MonitoredProcess]: Starting monitored process 26 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,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:23,065 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:23,065 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:23,065 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = -1*ULTIMATE.start_main_~s__state~0#1 + 8576 Supporting invariants [] [2024-10-12 00:26:23,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-12 00:26:23,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:23,079 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:23,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:23,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:23,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:23,177 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:23,178 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:26:23,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 90 transitions. cyclomatic complexity: 33 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:23,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 90 transitions. cyclomatic complexity: 33. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Result 167 states and 244 transitions. Complement of second has 9 states. [2024-10-12 00:26:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:26:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-10-12 00:26:23,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 10 letters. Loop has 6 letters. [2024-10-12 00:26:23,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:23,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 6 letters. [2024-10-12 00:26:23,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:23,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 10 letters. Loop has 12 letters. [2024-10-12 00:26:23,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:23,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 244 transitions. [2024-10-12 00:26:23,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2024-10-12 00:26:23,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 147 states and 216 transitions. [2024-10-12 00:26:23,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-10-12 00:26:23,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-12 00:26:23,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 216 transitions. [2024-10-12 00:26:23,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:23,254 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 216 transitions. [2024-10-12 00:26:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 216 transitions. [2024-10-12 00:26:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2024-10-12 00:26:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 140 states have internal predecessors, (207), 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:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-10-12 00:26:23,260 INFO L240 hiAutomatonCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-10-12 00:26:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:23,261 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:23,291 INFO L93 Difference]: Finished difference Result 180 states and 247 transitions. [2024-10-12 00:26:23,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 247 transitions. [2024-10-12 00:26:23,293 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36 [2024-10-12 00:26:23,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 170 states and 235 transitions. [2024-10-12 00:26:23,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-10-12 00:26:23,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2024-10-12 00:26:23,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 170 states and 235 transitions. [2024-10-12 00:26:23,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:23,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 170 states and 235 transitions. [2024-10-12 00:26:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states and 235 transitions. [2024-10-12 00:26:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2024-10-12 00:26:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.4315068493150684) internal successors, (209), 145 states have internal predecessors, (209), 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:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 209 transitions. [2024-10-12 00:26:23,303 INFO L240 hiAutomatonCegarLoop]: Abstraction has 146 states and 209 transitions. [2024-10-12 00:26:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:23,306 INFO L425 stractBuchiCegarLoop]: Abstraction has 146 states and 209 transitions. [2024-10-12 00:26:23,306 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:26:23,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 209 transitions. [2024-10-12 00:26:23,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2024-10-12 00:26:23,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:23,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:23,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,308 INFO L745 eck$LassoCheckResult]: Stem: 1752#$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(17, 2);call #Ultimate.allocInit(12, 3); 1740#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 1741#$Ultimate##5 assume !false; 1823#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 1824#L36 assume 8466 == main_~s__state~0#1; 1802#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 1799#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 1720#$Ultimate##5 [2024-10-12 00:26:23,309 INFO L747 eck$LassoCheckResult]: Loop: 1720#$Ultimate##5 assume !false; 1708#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 1709#L36 assume !(8466 == main_~s__state~0#1); 1738#L41 assume !(8512 == main_~s__state~0#1); 1747#L57 assume !(8640 == main_~s__state~0#1); 1716#L61 assume 8656 == main_~s__state~0#1; 1717#$Ultimate##31 assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; 1727#L100-1 assume 4 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 5; 1729#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 1735#$Ultimate##5 assume !false; 1820#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 1818#L36 assume 8466 == main_~s__state~0#1; 1758#$Ultimate##17 assume !(0 == main_~blastFlag~0#1); 1749#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 1720#$Ultimate##5 [2024-10-12 00:26:23,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 1 times [2024-10-12 00:26:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164038523] [2024-10-12 00:26:23,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:23,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1982564596, now seen corresponding path program 1 times [2024-10-12 00:26:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538654760] [2024-10-12 00:26:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:23,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538654760] [2024-10-12 00:26:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538654760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:23,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084150420] [2024-10-12 00:26:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:23,378 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:23,379 INFO L87 Difference]: Start difference. First operand 146 states and 209 transitions. cyclomatic complexity: 71 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:23,416 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2024-10-12 00:26:23,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 270 transitions. [2024-10-12 00:26:23,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2024-10-12 00:26:23,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 270 transitions. [2024-10-12 00:26:23,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-10-12 00:26:23,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-10-12 00:26:23,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 270 transitions. [2024-10-12 00:26:23,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:23,422 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 270 transitions. [2024-10-12 00:26:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 270 transitions. [2024-10-12 00:26:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-12 00:26:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.3917525773195876) internal successors, (270), 193 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 270 transitions. [2024-10-12 00:26:23,433 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 270 transitions. [2024-10-12 00:26:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:23,438 INFO L425 stractBuchiCegarLoop]: Abstraction has 194 states and 270 transitions. [2024-10-12 00:26:23,438 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:26:23,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 270 transitions. [2024-10-12 00:26:23,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2024-10-12 00:26:23,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:23,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:23,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,441 INFO L745 eck$LassoCheckResult]: Stem: 2106#$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(17, 2);call #Ultimate.allocInit(12, 3); 2084#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 2085#$Ultimate##5 assume !false; 2185#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2186#L36 assume 8466 == main_~s__state~0#1; 2164#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 2160#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 2128#$Ultimate##5 [2024-10-12 00:26:23,441 INFO L747 eck$LassoCheckResult]: Loop: 2128#$Ultimate##5 assume !false; 2142#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2140#L36 assume !(8466 == main_~s__state~0#1); 2138#L41 assume !(8512 == main_~s__state~0#1); 2136#L57 assume !(8640 == main_~s__state~0#1); 2062#L61 assume 8656 == main_~s__state~0#1; 2063#$Ultimate##31 assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; 2073#L100-1 assume !(4 == main_~blastFlag~0#1); 2074#L107 assume !(5 == main_~blastFlag~0#1); 2107#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 2108#$Ultimate##5 assume !false; 2169#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2170#L36 assume 8466 == main_~s__state~0#1; 2149#$Ultimate##17 assume !(0 == main_~blastFlag~0#1); 2145#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 2128#$Ultimate##5 [2024-10-12 00:26:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 2 times [2024-10-12 00:26:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642520224] [2024-10-12 00:26:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:23,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 862619384, now seen corresponding path program 1 times [2024-10-12 00:26:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209998878] [2024-10-12 00:26:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:23,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:23,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209998878] [2024-10-12 00:26:23,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209998878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:23,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:23,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328950500] [2024-10-12 00:26:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:23,497 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:23,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:23,498 INFO L87 Difference]: Start difference. First operand 194 states and 270 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:23,521 INFO L93 Difference]: Finished difference Result 169 states and 218 transitions. [2024-10-12 00:26:23,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 218 transitions. [2024-10-12 00:26:23,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-10-12 00:26:23,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 117 states and 149 transitions. [2024-10-12 00:26:23,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-10-12 00:26:23,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-10-12 00:26:23,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 149 transitions. [2024-10-12 00:26:23,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:23,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 149 transitions. [2024-10-12 00:26:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 149 transitions. [2024-10-12 00:26:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2024-10-12 00:26:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 1.276190476190476) internal successors, (134), 104 states have internal predecessors, (134), 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:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2024-10-12 00:26:23,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-10-12 00:26:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:23,529 INFO L425 stractBuchiCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-10-12 00:26:23,530 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:26:23,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 134 transitions. [2024-10-12 00:26:23,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2024-10-12 00:26:23,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:23,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:23,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,533 INFO L745 eck$LassoCheckResult]: Stem: 2457#$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(17, 2);call #Ultimate.allocInit(12, 3); 2446#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 2447#$Ultimate##5 assume !false; 2483#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2484#L36 assume 8466 == main_~s__state~0#1; 2477#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 2471#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 2473#$Ultimate##5 [2024-10-12 00:26:23,533 INFO L747 eck$LassoCheckResult]: Loop: 2473#$Ultimate##5 assume !false; 2504#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2500#L36 assume !(8466 == main_~s__state~0#1); 2501#L41 assume !(8512 == main_~s__state~0#1); 2459#L57 assume !(8640 == main_~s__state~0#1); 2427#L61 assume 8656 == main_~s__state~0#1; 2428#$Ultimate##31 assume 2 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 3; 2440#L100-1 assume !(4 == main_~blastFlag~0#1); 2441#L107 assume !(5 == main_~blastFlag~0#1); 2448#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 2433#$Ultimate##5 assume !false; 2423#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2424#L36 assume !(8466 == main_~s__state~0#1); 2443#L41 assume !(8512 == main_~s__state~0#1); 2452#L57 assume 8640 == main_~s__state~0#1; 2449#$Ultimate##26 assume !(3 == main_~blastFlag~0#1); 2451#L89-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; 2473#$Ultimate##5 [2024-10-12 00:26:23,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 3 times [2024-10-12 00:26:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372596170] [2024-10-12 00:26:23,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash 49895967, now seen corresponding path program 1 times [2024-10-12 00:26:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457181312] [2024-10-12 00:26:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457181312] [2024-10-12 00:26:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457181312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:23,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987119115] [2024-10-12 00:26:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:23,579 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:23,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:23,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:23,581 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:23,599 INFO L93 Difference]: Finished difference Result 116 states and 146 transitions. [2024-10-12 00:26:23,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 146 transitions. [2024-10-12 00:26:23,601 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2024-10-12 00:26:23,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 146 transitions. [2024-10-12 00:26:23,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2024-10-12 00:26:23,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-10-12 00:26:23,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 146 transitions. [2024-10-12 00:26:23,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:23,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 146 transitions. [2024-10-12 00:26:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 146 transitions. [2024-10-12 00:26:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-12 00:26:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 115 states have internal predecessors, (146), 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:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2024-10-12 00:26:23,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 146 transitions. [2024-10-12 00:26:23,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:23,611 INFO L425 stractBuchiCegarLoop]: Abstraction has 116 states and 146 transitions. [2024-10-12 00:26:23,611 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:26:23,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 146 transitions. [2024-10-12 00:26:23,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2024-10-12 00:26:23,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:23,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:23,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,613 INFO L745 eck$LassoCheckResult]: Stem: 2685#$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(17, 2);call #Ultimate.allocInit(12, 3); 2672#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 2673#$Ultimate##5 assume !false; 2742#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2741#L36 assume 8466 == main_~s__state~0#1; 2665#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 2666#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 2716#$Ultimate##5 [2024-10-12 00:26:23,613 INFO L747 eck$LassoCheckResult]: Loop: 2716#$Ultimate##5 assume !false; 2760#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2759#L36 assume !(8466 == main_~s__state~0#1); 2758#L41 assume !(8512 == main_~s__state~0#1); 2757#L57 assume !(8640 == main_~s__state~0#1); 2755#L61 assume 8656 == main_~s__state~0#1; 2754#$Ultimate##31 assume !(2 == main_~blastFlag~0#1); 2667#L100-1 assume !(4 == main_~blastFlag~0#1); 2668#L107 assume !(5 == main_~blastFlag~0#1); 2765#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 2729#$Ultimate##5 assume !false; 2764#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2763#L36 assume !(8466 == main_~s__state~0#1); 2761#L41 assume !(8512 == main_~s__state~0#1); 2703#L57 assume 8640 == main_~s__state~0#1; 2756#$Ultimate##26 assume !(3 == main_~blastFlag~0#1); 2762#L89-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8656; 2716#$Ultimate##5 [2024-10-12 00:26:23,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 4 times [2024-10-12 00:26:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489335230] [2024-10-12 00:26:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:23,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 750960545, now seen corresponding path program 1 times [2024-10-12 00:26:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289270833] [2024-10-12 00:26:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289270833] [2024-10-12 00:26:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289270833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:23,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:23,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:26:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866498762] [2024-10-12 00:26:23,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:23,657 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:26:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:23,658 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. cyclomatic complexity: 38 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:23,667 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2024-10-12 00:26:23,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 175 transitions. [2024-10-12 00:26:23,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2024-10-12 00:26:23,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 137 states and 167 transitions. [2024-10-12 00:26:23,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2024-10-12 00:26:23,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2024-10-12 00:26:23,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 167 transitions. [2024-10-12 00:26:23,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:23,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 167 transitions. [2024-10-12 00:26:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 167 transitions. [2024-10-12 00:26:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 109. [2024-10-12 00:26:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 108 states have internal predecessors, (136), 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:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 136 transitions. [2024-10-12 00:26:23,675 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 136 transitions. [2024-10-12 00:26:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:23,678 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 136 transitions. [2024-10-12 00:26:23,678 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:26:23,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 136 transitions. [2024-10-12 00:26:23,679 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2024-10-12 00:26:23,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:23,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:23,680 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,680 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:23,680 INFO L745 eck$LassoCheckResult]: Stem: 2951#$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(17, 2);call #Ultimate.allocInit(12, 3); 2938#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 2939#$Ultimate##5 assume !false; 2916#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2917#L36 assume 8466 == main_~s__state~0#1; 2937#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 2983#L69-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8656; 2924#$Ultimate##5 [2024-10-12 00:26:23,683 INFO L747 eck$LassoCheckResult]: Loop: 2924#$Ultimate##5 assume !false; 2914#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 2915#L36 assume !(8466 == main_~s__state~0#1); 2936#L41 assume !(8512 == main_~s__state~0#1); 2946#L57 assume !(8640 == main_~s__state~0#1); 2918#L61 assume 8656 == main_~s__state~0#1; 2919#$Ultimate##31 assume !(2 == main_~blastFlag~0#1); 3015#L100-1 assume !(4 == main_~blastFlag~0#1); 2941#L107 assume !(5 == main_~blastFlag~0#1); 2942#L104-1 assume 0 != main_~s__hit~0#1;main_~s__state~0#1 := 8640; 2924#$Ultimate##5 [2024-10-12 00:26:23,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723569, now seen corresponding path program 5 times [2024-10-12 00:26:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921459249] [2024-10-12 00:26:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:23,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1947655960, now seen corresponding path program 1 times [2024-10-12 00:26:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694309123] [2024-10-12 00:26:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:23,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:23,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 163931656, now seen corresponding path program 1 times [2024-10-12 00:26:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370172058] [2024-10-12 00:26:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:23,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:26:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370172058] [2024-10-12 00:26:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370172058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:26:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072847475] [2024-10-12 00:26:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:23,813 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:23,813 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:23,813 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:23,813 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:23,814 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:23,814 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,814 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:23,814 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:23,814 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration9_Loop [2024-10-12 00:26:23,814 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:23,814 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:23,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:23,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:23,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:23,886 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:23,886 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:23,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:23,889 INFO L229 MonitoredProcess]: Starting monitored process 27 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,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:26:23,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:23,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:23,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:23,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:23,929 INFO L229 MonitoredProcess]: Starting monitored process 28 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,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:23,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:23,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:26:23,944 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:23,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:26:23,959 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:23,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:23,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:23,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:23,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:23,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:23,960 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:23,960 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:23,960 INFO L132 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1b.cil.c_Iteration9_Loop [2024-10-12 00:26:23,960 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:23,960 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:23,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:23,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:23,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:24,048 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:24,049 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:24,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:24,050 INFO L229 MonitoredProcess]: Starting monitored process 29 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:24,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:26:24,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:26:24,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:24,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:24,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:24,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:24,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:24,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:24,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:24,066 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:24,070 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:24,070 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-12 00:26:24,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:24,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:24,072 INFO L229 MonitoredProcess]: Starting monitored process 30 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:24,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:26:24,073 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:24,073 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:24,073 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:24,073 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0#1) = 1*ULTIMATE.start_main_~s__state~0#1 Supporting invariants [] [2024-10-12 00:26:24,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:26:24,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:24,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:24,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:24,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:24,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:24,146 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,147 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:26:24,147 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 136 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 136 transitions. cyclomatic complexity: 36. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Result 148 states and 178 transitions. Complement of second has 6 states. [2024-10-12 00:26:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:26:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2024-10-12 00:26:24,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 10 letters. [2024-10-12 00:26:24,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:24,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 17 letters. Loop has 10 letters. [2024-10-12 00:26:24,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:24,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 7 letters. Loop has 20 letters. [2024-10-12 00:26:24,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:24,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 178 transitions. [2024-10-12 00:26:24,167 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 41 [2024-10-12 00:26:24,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 109 states and 132 transitions. [2024-10-12 00:26:24,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-10-12 00:26:24,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-10-12 00:26:24,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 132 transitions. [2024-10-12 00:26:24,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:24,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 132 transitions. [2024-10-12 00:26:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 132 transitions. [2024-10-12 00:26:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-12 00:26:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 108 states have internal predecessors, (132), 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,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2024-10-12 00:26:24,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 132 transitions. [2024-10-12 00:26:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:24,172 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:24,185 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-10-12 00:26:24,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 106 transitions. [2024-10-12 00:26:24,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2024-10-12 00:26:24,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 62 states and 71 transitions. [2024-10-12 00:26:24,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-12 00:26:24,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-12 00:26:24,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 71 transitions. [2024-10-12 00:26:24,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:24,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-12 00:26:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 71 transitions. [2024-10-12 00:26:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-12 00:26:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 61 states have internal predecessors, (71), 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,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-10-12 00:26:24,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-12 00:26:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:24,190 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-12 00:26:24,190 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:26:24,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 71 transitions. [2024-10-12 00:26:24,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2024-10-12 00:26:24,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:24,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:24,191 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:24,191 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:24,191 INFO L745 eck$LassoCheckResult]: Stem: 3477#$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(17, 2);call #Ultimate.allocInit(12, 3); 3466#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_~s__state~0#1, main_~s__hit~0#1, main_~blastFlag~0#1, main_~tmp___1~0#1;havoc main_~s__state~0#1;havoc main_#t~nondet4#1;main_~s__hit~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~blastFlag~0#1;havoc main_~tmp___1~0#1;main_~s__state~0#1 := 8466;main_~blastFlag~0#1 := 0; 3467#$Ultimate##5 assume !false; 3496#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3495#L36 assume 8466 == main_~s__state~0#1; 3494#$Ultimate##17 assume 0 == main_~blastFlag~0#1;main_~blastFlag~0#1 := 2; 3493#L69-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 3486#$Ultimate##5 assume !false; 3484#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3482#L36 assume !(8466 == main_~s__state~0#1); 3481#L41 assume 8512 == main_~s__state~0#1; 3450#main_switch_1_8512#1 [2024-10-12 00:26:24,191 INFO L747 eck$LassoCheckResult]: Loop: 3450#main_switch_1_8512#1 havoc main_#t~nondet5#1;main_~tmp___1~0#1 := main_#t~nondet5#1; 3451#L81 assume 0 != main_~tmp___1~0#1;main_~s__state~0#1 := 8466; 3464#$Ultimate##5 assume !false; 3501#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3499#L36 assume 8466 == main_~s__state~0#1; 3458#$Ultimate##17 assume !(0 == main_~blastFlag~0#1); 3459#L69-1 assume !(0 != main_~s__hit~0#1);main_~s__state~0#1 := 8512; 3475#$Ultimate##5 assume !false; 3498#L30 assume !(main_~s__state~0#1 <= 8512 && main_~blastFlag~0#1 > 2); 3497#L36 assume !(8466 == main_~s__state~0#1); 3480#L41 assume 8512 == main_~s__state~0#1; 3450#main_switch_1_8512#1 [2024-10-12 00:26:24,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,192 INFO L85 PathProgramCache]: Analyzing trace with hash 21626939, now seen corresponding path program 1 times [2024-10-12 00:26:24,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097555452] [2024-10-12 00:26:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1294878776, now seen corresponding path program 1 times [2024-10-12 00:26:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660354102] [2024-10-12 00:26:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash 937672638, now seen corresponding path program 1 times [2024-10-12 00:26:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763980781] [2024-10-12 00:26:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:24,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:26:24 BoogieIcfgContainer [2024-10-12 00:26:24,461 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:26:24,462 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:26:24,462 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:26:24,462 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:26:24,462 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:19" (3/4) ... [2024-10-12 00:26:24,464 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:26:24,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:26:24,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:26:24,510 INFO L158 Benchmark]: Toolchain (without parser) took 5193.02ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 113.9MB in the beginning and 98.7MB in the end (delta: 15.3MB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,510 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:24,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.65ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 101.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 99.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,511 INFO L158 Benchmark]: Boogie Preprocessor took 36.56ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,511 INFO L158 Benchmark]: RCFGBuilder took 298.97ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 86.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,511 INFO L158 Benchmark]: BuchiAutomizer took 4463.67ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 86.7MB in the beginning and 100.7MB in the end (delta: -14.0MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,511 INFO L158 Benchmark]: Witness Printer took 47.82ms. Allocated memory is still 253.8MB. Free memory was 100.7MB in the beginning and 98.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:24,513 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.65ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 101.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 99.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.56ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 98.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.97ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 86.7MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4463.67ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 86.7MB in the beginning and 100.7MB in the end (delta: -14.0MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * Witness Printer took 47.82ms. Allocated memory is still 253.8MB. Free memory was 100.7MB in the beginning and 98.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 5 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * blastFlag) + 1) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -1 * s__state) + 8489) and consists of 4 locations. One deterministic module has affine ranking function s__state and consists of 5 locations. One deterministic module has affine ranking function (8576 + ((long long) -1 * s__state)) and consists of 5 locations. One deterministic module has affine ranking function s__state and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 62 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 13. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 539 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 340 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT1 conc0 concLT4 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf89 smp100 dnf145 smp81 tf114 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 79]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int blastFlag ; [L24] int tmp___1; [L26] s__state = 8466 [L27] blastFlag = 0 VAL [blastFlag=0, s__state=8466] [L29] COND TRUE 1 VAL [blastFlag=0, s__state=8466] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__state=8466] [L36] COND TRUE s__state == 8466 VAL [blastFlag=0] [L69] COND TRUE blastFlag == 0 [L70] blastFlag = 2 VAL [blastFlag=2] [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__state=8512] [L29] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__state=8512] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__state=8512] [L36] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__state=8512] [L41] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0] Loop: [L80] tmp___1 = __VERIFIER_nondet_int() [L81] COND TRUE \read(tmp___1) [L82] s__state = 8466 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND TRUE s__state == 8466 [L69] COND FALSE !(blastFlag == 0) [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND FALSE !(s__state == 8466) [L41] COND TRUE s__state == 8512 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 79]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L21] int s__state ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int blastFlag ; [L24] int tmp___1; [L26] s__state = 8466 [L27] blastFlag = 0 VAL [blastFlag=0, s__state=8466] [L29] COND TRUE 1 VAL [blastFlag=0, s__state=8466] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=0, s__state=8466] [L36] COND TRUE s__state == 8466 VAL [blastFlag=0] [L69] COND TRUE blastFlag == 0 [L70] blastFlag = 2 VAL [blastFlag=2] [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 VAL [blastFlag=2, s__hit=0, s__state=8512] [L29] COND TRUE 1 VAL [blastFlag=2, s__hit=0, s__state=8512] [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) VAL [blastFlag=2, s__hit=0, s__state=8512] [L36] COND FALSE !(s__state == 8466) VAL [blastFlag=2, s__hit=0, s__state=8512] [L41] COND TRUE s__state == 8512 VAL [blastFlag=2, s__hit=0] Loop: [L80] tmp___1 = __VERIFIER_nondet_int() [L81] COND TRUE \read(tmp___1) [L82] s__state = 8466 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND TRUE s__state == 8466 [L69] COND FALSE !(blastFlag == 0) [L72] COND FALSE !(\read(s__hit)) [L75] s__state = 8512 [L29] COND TRUE 1 [L30] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L36] COND FALSE !(s__state == 8466) [L41] COND TRUE s__state == 8512 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 00:26:24,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:24,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:24,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)