./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:08:53,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:08:53,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:08:53,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:08:53,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:08:53,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:08:53,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:08:53,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:08:53,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:08:53,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:08:53,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:08:53,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:08:53,848 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:08:53,851 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:08:53,851 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:08:53,852 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:08:53,852 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:08:53,852 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:08:53,852 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:08:53,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:08:53,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:08:53,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:08:53,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:08:53,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:08:53,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:08:53,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:08:53,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:08:53,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:08:53,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:08:53,856 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:08:53,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:08:53,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:08:53,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:08:53,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:08:53,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:08:53,858 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:08:53,858 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0671ae6ff503095cbeea151b096da898df643465964474a4f3e3c55275f454c [2024-10-15 00:08:54,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:08:54,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:08:54,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:08:54,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:08:54,148 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:08:54,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2024-10-15 00:08:55,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:08:55,847 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:08:55,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-2.c [2024-10-15 00:08:55,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15ecafda/eea05c41621c4e68afbe0cb0e8ba626e/FLAG60c93ec44 [2024-10-15 00:08:55,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15ecafda/eea05c41621c4e68afbe0cb0e8ba626e [2024-10-15 00:08:55,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:08:55,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:08:55,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:08:55,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:08:55,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:08:55,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:55" (1/1) ... [2024-10-15 00:08:55,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61929a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55, skipping insertion in model container [2024-10-15 00:08:55,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:55" (1/1) ... [2024-10-15 00:08:55,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:08:56,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:08:56,038 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:08:56,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:08:56,078 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:08:56,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56 WrapperNode [2024-10-15 00:08:56,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:08:56,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:08:56,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:08:56,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:08:56,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,116 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-10-15 00:08:56,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:08:56,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:08:56,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:08:56,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:08:56,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,153 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-15 00:08:56,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:08:56,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:08:56,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:08:56,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:08:56,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (1/1) ... [2024-10-15 00:08:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:56,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:56,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:08:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:08:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:08:56,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:08:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:08:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:08:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:08:56,328 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:08:56,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:08:56,466 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 00:08:56,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:08:56,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:08:56,476 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:08:56,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:56 BoogieIcfgContainer [2024-10-15 00:08:56,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:08:56,478 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:08:56,478 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:08:56,482 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:08:56,482 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:56,483 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:08:55" (1/3) ... [2024-10-15 00:08:56,484 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e86510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:08:56, skipping insertion in model container [2024-10-15 00:08:56,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:56,484 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:56" (2/3) ... [2024-10-15 00:08:56,484 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e86510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:08:56, skipping insertion in model container [2024-10-15 00:08:56,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:08:56,485 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:56" (3/3) ... [2024-10-15 00:08:56,486 INFO L332 chiAutomizerObserver]: Analyzing ICFG NonTermination3-2.c [2024-10-15 00:08:56,538 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:08:56,538 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:08:56,538 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:08:56,538 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:08:56,539 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:08:56,539 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:08:56,539 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:08:56,539 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:08:56,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-15 00:08:56,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-10-15 00:08:56,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:56,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:56,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:08:56,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:56,563 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:08:56,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-15 00:08:56,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-10-15 00:08:56,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:56,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:56,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:08:56,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:08:56,574 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 7#L13-3true [2024-10-15 00:08:56,575 INFO L747 eck$LassoCheckResult]: Loop: 7#L13-3true assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 5#L13-2true main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 7#L13-3true [2024-10-15 00:08:56,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:56,581 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:08:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:56,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288827515] [2024-10-15 00:08:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:56,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:56,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:56,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:56,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-15 00:08:56,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704924310] [2024-10-15 00:08:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:56,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:56,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:56,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-15 00:08:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893457179] [2024-10-15 00:08:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:56,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:56,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:57,024 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:08:57,024 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:08:57,024 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:08:57,024 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:08:57,025 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:08:57,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:08:57,025 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:08:57,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: NonTermination3-2.c_Iteration1_Lasso [2024-10-15 00:08:57,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:08:57,025 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:08:57,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:08:57,266 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:08:57,270 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:08:57,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:08:57,277 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-15 00:08:57,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:57,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:57,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:57,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:57,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:57,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:57,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:57,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:57,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:08:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:08:57,322 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-15 00:08:57,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:57,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:57,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:57,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:57,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:57,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:57,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:57,342 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:57,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:08:57,360 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-15 00:08:57,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:57,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:57,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:57,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:57,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:57,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:57,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:57,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:57,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-15 00:08:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:08:57,396 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-15 00:08:57,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:57,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:57,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:57,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:57,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:57,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:57,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:57,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-15 00:08:57,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:08:57,517 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-15 00:08:57,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:57,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:08:57,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:57,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:57,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:57,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:08:57,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:08:57,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:08:57,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-15 00:08:57,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,560 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:08:57,564 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-15 00:08:57,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:08:57,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:08:57,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:08:57,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:08:57,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:08:57,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:08:57,597 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:08:57,653 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-15 00:08:57,654 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-10-15 00:08:57,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:08:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:57,659 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:08:57,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:08:57,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:08:57,677 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:08:57,677 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:08:57,678 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~n~0#1 + 19*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2024-10-15 00:08:57,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:08:57,703 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-10-15 00:08:57,714 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-15 00:08:57,715 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-15 00:08:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:57,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:08:57,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:57,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:57,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:57,811 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-15 00:08:57,847 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-15 00:08:57,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 00:08:57,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 22 states and 31 transitions. Complement of second has 6 states. [2024-10-15 00:08:57,902 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-15 00:08:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 00:08:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-10-15 00:08:57,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-15 00:08:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-15 00:08:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-15 00:08:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:08:57,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2024-10-15 00:08:57,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:57,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 9 states and 12 transitions. [2024-10-15 00:08:57,920 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-15 00:08:57,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:08:57,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2024-10-15 00:08:57,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:08:57,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-15 00:08:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2024-10-15 00:08:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-15 00:08:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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-15 00:08:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2024-10-15 00:08:57,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-15 00:08:57,947 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2024-10-15 00:08:57,948 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:08:57,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2024-10-15 00:08:57,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:57,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:57,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:57,949 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-15 00:08:57,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:57,949 INFO L745 eck$LassoCheckResult]: Stem: 78#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 76#L13-3 assume !(main_~n~0#1 < 10); 77#L13-4 havoc main_~n~0#1; 80#L17-5 [2024-10-15 00:08:57,949 INFO L747 eck$LassoCheckResult]: Loop: 80#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 82#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 81#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 80#L17-5 [2024-10-15 00:08:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-15 00:08:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186324504] [2024-10-15 00:08:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:58,031 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-15 00:08:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186324504] [2024-10-15 00:08:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186324504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:08:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:08:58,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:08:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104932239] [2024-10-15 00:08:58,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:08:58,039 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:08:58,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 1 times [2024-10-15 00:08:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276128506] [2024-10-15 00:08:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:58,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:58,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:58,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 00:08:58,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 00:08:58,179 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-15 00:08:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:58,193 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2024-10-15 00:08:58,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2024-10-15 00:08:58,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:58,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2024-10-15 00:08:58,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:08:58,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:08:58,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2024-10-15 00:08:58,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:08:58,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-15 00:08:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2024-10-15 00:08:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-10-15 00:08:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-15 00:08:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2024-10-15 00:08:58,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-10-15 00:08:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 00:08:58,202 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2024-10-15 00:08:58,202 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:08:58,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2024-10-15 00:08:58,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:58,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:58,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:58,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-15 00:08:58,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:58,203 INFO L745 eck$LassoCheckResult]: Stem: 101#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 102#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 103#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 99#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 100#L13-3 assume !(main_~n~0#1 < 10); 104#L13-4 havoc main_~n~0#1; 107#L17-5 [2024-10-15 00:08:58,203 INFO L747 eck$LassoCheckResult]: Loop: 107#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 105#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 106#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 107#L17-5 [2024-10-15 00:08:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-10-15 00:08:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548933820] [2024-10-15 00:08:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:58,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548933820] [2024-10-15 00:08:58,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548933820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:08:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077322700] [2024-10-15 00:08:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:58,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:08:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:58,285 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:08:58,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 00:08:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:58,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 00:08:58,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:58,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:08:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077322700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:08:58,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:08:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-15 00:08:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375956344] [2024-10-15 00:08:58,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:08:58,357 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:08:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 2 times [2024-10-15 00:08:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769310679] [2024-10-15 00:08:58,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:58,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:58,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 00:08:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 00:08:58,477 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-15 00:08:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:58,502 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-10-15 00:08:58,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2024-10-15 00:08:58,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:58,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2024-10-15 00:08:58,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:08:58,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:08:58,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-10-15 00:08:58,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:08:58,505 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-15 00:08:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-10-15 00:08:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-15 00:08:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 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-15 00:08:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-15 00:08:58,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-15 00:08:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 00:08:58,508 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-15 00:08:58,508 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:08:58,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2024-10-15 00:08:58,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:58,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:58,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:58,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-10-15 00:08:58,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:58,510 INFO L745 eck$LassoCheckResult]: Stem: 165#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 167#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 168#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 169#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 163#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 164#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 177#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 176#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 175#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 174#L13-3 assume !(main_~n~0#1 < 10); 173#L13-4 havoc main_~n~0#1; 172#L17-5 [2024-10-15 00:08:58,510 INFO L747 eck$LassoCheckResult]: Loop: 172#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 170#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 171#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 172#L17-5 [2024-10-15 00:08:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-10-15 00:08:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:58,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011668630] [2024-10-15 00:08:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:08:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:08:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011668630] [2024-10-15 00:08:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011668630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:08:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765039306] [2024-10-15 00:08:58,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:08:58,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:08:58,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:08:58,643 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:08:58,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 00:08:58,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:08:58,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:08:58,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 00:08:58,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:08:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:58,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:08:58,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-15 00:08:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:08:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765039306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:08:58,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:08:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-15 00:08:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458336438] [2024-10-15 00:08:58,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:08:58,855 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:08:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:58,856 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 3 times [2024-10-15 00:08:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824137985] [2024-10-15 00:08:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:58,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:58,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:08:58,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 00:08:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-15 00:08:58,978 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 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-15 00:08:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:08:59,038 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-15 00:08:59,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2024-10-15 00:08:59,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:59,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2024-10-15 00:08:59,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:08:59,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-15 00:08:59,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2024-10-15 00:08:59,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:08:59,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-15 00:08:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2024-10-15 00:08:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-15 00:08:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 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-15 00:08:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-10-15 00:08:59,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-15 00:08:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 00:08:59,054 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-10-15 00:08:59,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:08:59,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2024-10-15 00:08:59,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:08:59,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:08:59,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:08:59,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-10-15 00:08:59,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:08:59,060 INFO L745 eck$LassoCheckResult]: Stem: 289#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~pre2#1, main_~n~0#1, main_#t~mem3#1, main_#t~short4#1, main_#t~nondet5#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(40);main_~n~0#1 := 0; 291#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 292#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 293#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 287#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 288#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 313#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 312#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 311#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 310#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 309#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 308#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 307#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 306#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 305#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 304#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 303#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 302#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 301#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 300#L13-3 assume !!(main_~n~0#1 < 10);havoc main_#t~nondet1#1;call write~int#0(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~n~0#1, 4);havoc main_#t~nondet1#1; 299#L13-2 main_#t~pre2#1 := 1 + main_~n~0#1;main_~n~0#1 := 1 + main_~n~0#1;havoc main_#t~pre2#1; 298#L13-3 assume !(main_~n~0#1 < 10); 294#L13-4 havoc main_~n~0#1; 295#L17-5 [2024-10-15 00:08:59,060 INFO L747 eck$LassoCheckResult]: Loop: 295#L17-5 main_#t~short4#1 := 0 <= main_~i~0#1 && main_~i~0#1 < 10; 296#L17-1 assume main_#t~short4#1;call main_#t~mem3#1 := read~int#0(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);main_#t~short4#1 := main_#t~mem3#1 >= 0; 297#L17-3 assume !!main_#t~short4#1;havoc main_#t~mem3#1;havoc main_#t~short4#1;call write~int#0(0, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet5#1;main_~i~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 295#L17-5 [2024-10-15 00:08:59,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-10-15 00:08:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244213903] [2024-10-15 00:08:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:59,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:59,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:59,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 50748, now seen corresponding path program 4 times [2024-10-15 00:08:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577403114] [2024-10-15 00:08:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:59,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:59,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:08:59,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:08:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1328177118, now seen corresponding path program 1 times [2024-10-15 00:08:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:08:59,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857732200] [2024-10-15 00:08:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:08:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:08:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:59,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:08:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:08:59,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:09:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:01,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:09:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:09:02,015 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-15 00:09:02,021 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-15 00:09:02,034 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-15 00:09:02,036 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-15 00:09:02,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.10 12:09:02 BoogieIcfgContainer [2024-10-15 00:09:02,038 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-15 00:09:02,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 00:09:02,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 00:09:02,039 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 00:09:02,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:56" (3/4) ... [2024-10-15 00:09:02,041 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-15 00:09:02,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-15 00:09:02,051 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-10-15 00:09:02,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-15 00:09:02,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 00:09:02,108 INFO L158 Benchmark]: Toolchain (without parser) took 6239.19ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 115.9MB in the beginning and 112.9MB in the end (delta: 3.0MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,108 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 115.3MB. Free memory was 74.2MB in the beginning and 74.0MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 00:09:02,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.38ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 105.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.17ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,109 INFO L158 Benchmark]: Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,109 INFO L158 Benchmark]: RCFGBuilder took 309.31ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 91.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,109 INFO L158 Benchmark]: BuchiAutomizer took 5560.31ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 91.0MB in the beginning and 115.9MB in the end (delta: -25.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,109 INFO L158 Benchmark]: Witness Printer took 68.15ms. Allocated memory is still 172.0MB. Free memory was 115.0MB in the beginning and 112.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 00:09:02,111 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.20ms. Allocated memory is still 115.3MB. Free memory was 74.2MB in the beginning and 74.0MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.38ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 105.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.17ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.54ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 102.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 309.31ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 91.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5560.31ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 91.0MB in the beginning and 115.9MB in the end (delta: -25.0MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 68.15ms. Allocated memory is still 172.0MB. Free memory was 115.0MB in the beginning and 112.9MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function null and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 27 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 5 iterations. TraceHistogramMax:10. Analysis of lassos took 5.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp100 ukn59 mio100 lsp62 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}] Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n VAL [a={2:0}, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}] Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-15 00:09:02,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-15 00:09:02,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-15 00:09:02,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)