./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:05:20,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:05:20,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:05:20,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:05:20,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:05:20,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:05:20,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:05:20,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:05:20,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:05:20,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:05:20,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:05:20,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:05:20,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:05:20,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:05:20,386 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:05:20,386 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:05:20,386 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:05:20,386 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:05:20,387 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:05:20,387 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:05:20,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:05:20,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:05:20,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:05:20,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:05:20,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:05:20,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:05:20,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:05:20,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:05:20,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:05:20,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:05:20,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:05:20,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:05:20,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:05:20,391 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:05:20,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:05:20,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:05:20,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:05:20,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:05:20,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:05:20,394 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:05:20,394 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ee63462f1ec886f4aa9c5663162640144e173530e57636655ca95f3d6ab0ae72 [2024-11-10 23:05:20,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:05:20,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:05:20,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:05:20,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:05:20,687 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:05:20,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2024-11-10 23:05:22,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:05:22,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:05:22,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.8.i [2024-11-10 23:05:22,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87c26221/841c683de33c4ba7abfc22936b673a32/FLAGe836b9536 [2024-11-10 23:05:22,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87c26221/841c683de33c4ba7abfc22936b673a32 [2024-11-10 23:05:22,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:05:22,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:05:22,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:22,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:05:22,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:05:22,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43dfa2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22, skipping insertion in model container [2024-11-10 23:05:22,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:05:22,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:22,586 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:05:22,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:05:22,613 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:05:22,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22 WrapperNode [2024-11-10 23:05:22,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:05:22,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:22,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:05:22,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:05:22,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,643 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 36 [2024-11-10 23:05:22,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:05:22,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:05:22,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:05:22,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:05:22,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,671 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 23:05:22,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:05:22,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:05:22,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:05:22,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:05:22,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (1/1) ... [2024-11-10 23:05:22,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:22,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:22,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:22,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:05:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:05:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:05:22,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:05:22,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:05:22,803 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:05:22,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:05:22,890 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 23:05:22,891 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:05:22,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:05:22,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:05:22,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:22 BoogieIcfgContainer [2024-11-10 23:05:22,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:05:22,903 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:05:22,903 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:05:22,907 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:05:22,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:22,908 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:05:22" (1/3) ... [2024-11-10 23:05:22,909 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@439d6102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:22, skipping insertion in model container [2024-11-10 23:05:22,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:22,909 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:05:22" (2/3) ... [2024-11-10 23:05:22,909 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@439d6102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:05:22, skipping insertion in model container [2024-11-10 23:05:22,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:05:22,909 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:22" (3/3) ... [2024-11-10 23:05:22,911 INFO L332 chiAutomizerObserver]: Analyzing ICFG mine2017-ex4.8.i [2024-11-10 23:05:22,956 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:05:22,956 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:05:22,956 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:05:22,957 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:05:22,957 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:05:22,957 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:05:22,957 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:05:22,957 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:05:22,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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-11-10 23:05:22,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 23:05:22,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:22,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:23,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:23,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:23,001 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:05:23,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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-11-10 23:05:23,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-10 23:05:23,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:23,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:23,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 23:05:23,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:23,009 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 14#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0; 11#L17true [2024-11-10 23:05:23,009 INFO L747 eck$LassoCheckResult]: Loop: 11#L17true assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 17#L17-1true assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 12#L13-1true assume !(0 == __VERIFIER_assert_~cond#1); 7#__VERIFIER_assert_returnLabel#1true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 13#L13true assume !(0 == __VERIFIER_assert_~cond#1); 9#__VERIFIER_assert_returnLabel#2true assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 18#L20true assume 0 == main_~v~0#1;main_~v~0#1 := 1; 11#L17true [2024-11-10 23:05:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 1 times [2024-11-10 23:05:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784566991] [2024-11-10 23:05:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:23,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:23,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:23,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1327391439, now seen corresponding path program 1 times [2024-11-10 23:05:23,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:23,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413306794] [2024-11-10 23:05:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:23,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:23,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:23,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:23,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 259477232, now seen corresponding path program 1 times [2024-11-10 23:05:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623207027] [2024-11-10 23:05:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:23,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:23,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:23,349 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:23,349 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:23,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:23,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:23,350 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 23:05:23,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:23,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:23,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: mine2017-ex4.8.i_Iteration1_Loop [2024-11-10 23:05:23,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:23,350 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:23,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,416 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:23,417 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 23:05:23,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,420 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-11-10 23:05:23,421 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-11-10 23:05:23,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:23,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:23,444 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:23,445 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:23,458 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-11-10 23:05:23,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,460 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-11-10 23:05:23,461 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-11-10 23:05:23,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:23,462 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:23,473 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:23,473 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:23,484 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-11-10 23:05:23,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,487 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-11-10 23:05:23,488 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-11-10 23:05:23,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:23,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:23,505 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-10 23:05:23,505 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-10 23:05:23,519 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-11-10 23:05:23,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,523 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-11-10 23:05:23,524 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-11-10 23:05:23,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 23:05:23,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:23,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,550 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-11-10 23:05:23,551 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-11-10 23:05:23,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 23:05:23,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 23:05:23,570 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 23:05:23,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 23:05:23,585 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 23:05:23,585 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 23:05:23,585 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 23:05:23,585 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 23:05:23,585 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 23:05:23,585 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,585 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 23:05:23,585 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 23:05:23,585 INFO L132 ssoRankerPreferences]: Filename of dumped script: mine2017-ex4.8.i_Iteration1_Loop [2024-11-10 23:05:23,585 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 23:05:23,586 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 23:05:23,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 23:05:23,643 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 23:05:23,648 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 23:05:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,651 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-11-10 23:05:23,653 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-11-10 23:05:23,655 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-11-10 23:05:23,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:23,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:23,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:23,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:23,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:23,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:23,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:23,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:23,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-11-10 23:05:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,695 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-11-10 23:05:23,696 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-11-10 23:05:23,697 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-11-10 23:05:23,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:23,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:23,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:23,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:23,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:23,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:23,711 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:23,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:23,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:23,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-10 23:05:23,725 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-11-10 23:05:23,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:23,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:23,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:23,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:23,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:23,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:23,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:23,738 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 23:05:23,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,754 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:23,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-10 23:05:23,757 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-11-10 23:05:23,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 23:05:23,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 23:05:23,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 23:05:23,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 23:05:23,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 23:05:23,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 23:05:23,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 23:05:23,774 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 23:05:23,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 23:05:23,777 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-10 23:05:23,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:05:23,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:05:23,780 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:05:23,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-10 23:05:23,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 23:05:23,782 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 23:05:23,783 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 23:05:23,783 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v~0#1) = -2*ULTIMATE.start_main_~v~0#1 + 1 Supporting invariants [] [2024-11-10 23:05:23,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-10 23:05:23,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 23:05:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:23,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 23:05:23,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:23,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 23:05:23,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:05:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:23,937 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 23:05:23,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:23,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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). Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 67 transitions. Complement of second has 6 states. [2024-11-10 23:05:23,993 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-11-10 23:05:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2024-11-10 23:05:23,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 7 letters. [2024-11-10 23:05:24,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:24,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 9 letters. Loop has 7 letters. [2024-11-10 23:05:24,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:24,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 14 letters. [2024-11-10 23:05:24,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 23:05:24,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 67 transitions. [2024-11-10 23:05:24,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 23:05:24,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 19 states and 22 transitions. [2024-11-10 23:05:24,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 23:05:24,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2024-11-10 23:05:24,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2024-11-10 23:05:24,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:24,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-10 23:05:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2024-11-10 23:05:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-10 23:05:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-10 23:05:24,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-10 23:05:24,029 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-10 23:05:24,029 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:05:24,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2024-11-10 23:05:24,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 23:05:24,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:24,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:24,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:05:24,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:24,033 INFO L745 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 132#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0; 133#L17 assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 120#L17-1 [2024-11-10 23:05:24,033 INFO L747 eck$LassoCheckResult]: Loop: 120#L17-1 assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 123#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 124#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 127#L13 assume !(0 == __VERIFIER_assert_~cond#1); 128#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 134#L20 assume !(0 == main_~v~0#1); 119#L17 assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 120#L17-1 [2024-11-10 23:05:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 55575, now seen corresponding path program 1 times [2024-11-10 23:05:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954433864] [2024-11-10 23:05:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:24,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 319794460, now seen corresponding path program 1 times [2024-11-10 23:05:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186716748] [2024-11-10 23:05:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:24,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:24,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash -546140346, now seen corresponding path program 1 times [2024-11-10 23:05:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:24,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813431945] [2024-11-10 23:05:24,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:05:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:05:24,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:05:24,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813431945] [2024-11-10 23:05:24,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813431945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:05:24,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:05:24,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 23:05:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970848239] [2024-11-10 23:05:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:05:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:05:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 23:05:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 23:05:24,274 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:05:24,286 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-10 23:05:24,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2024-11-10 23:05:24,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 23:05:24,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 26 transitions. [2024-11-10 23:05:24,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-11-10 23:05:24,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-10 23:05:24,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2024-11-10 23:05:24,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 23:05:24,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-10 23:05:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2024-11-10 23:05:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-10 23:05:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 23:05:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-10 23:05:24,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-10 23:05:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 23:05:24,292 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-10 23:05:24,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:05:24,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2024-11-10 23:05:24,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-10 23:05:24,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:05:24,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:05:24,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:24,293 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:05:24,293 INFO L745 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(22, 2); 188#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~v~0#1;main_~v~0#1 := 0; 175#L17 assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 176#L17-1 assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 181#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 182#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 185#L13 assume !(0 == __VERIFIER_assert_~cond#1); 186#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 191#L20 assume 0 == main_~v~0#1;main_~v~0#1 := 1; 193#L17 assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 189#L17-1 [2024-11-10 23:05:24,293 INFO L747 eck$LassoCheckResult]: Loop: 189#L17-1 assume !!(0 == (if main_#t~nondet1#1 % 256 % 4294967296 <= 2147483647 then main_#t~nondet1#1 % 256 % 4294967296 else main_#t~nondet1#1 % 256 % 4294967296 - 4294967296));havoc main_#t~nondet1#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 <= main_~v~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 179#L13-1 assume !(0 == __VERIFIER_assert_~cond#1); 180#__VERIFIER_assert_returnLabel#1 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~v~0#1 <= 1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 183#L13 assume !(0 == __VERIFIER_assert_~cond#1); 184#__VERIFIER_assert_returnLabel#2 assume true;havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; 190#L20 assume !(0 == main_~v~0#1); 192#L17 assume true;havoc main_#t~nondet1#1;assume 0 == main_#t~nondet1#1 || 1 == main_#t~nondet1#1; 189#L17-1 [2024-11-10 23:05:24,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:24,294 INFO L85 PathProgramCache]: Analyzing trace with hash -546140377, now seen corresponding path program 2 times [2024-11-10 23:05:24,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89551465] [2024-11-10 23:05:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash 319794460, now seen corresponding path program 2 times [2024-11-10 23:05:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:24,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674093014] [2024-11-10 23:05:24,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:05:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2099583178, now seen corresponding path program 1 times [2024-11-10 23:05:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:05:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550952322] [2024-11-10 23:05:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:05:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:05:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:05:24,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-10 23:05:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:05:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:05:24,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:05:24 BoogieIcfgContainer [2024-11-10 23:05:24,701 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 23:05:24,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 23:05:24,702 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 23:05:24,702 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 23:05:24,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:05:22" (3/4) ... [2024-11-10 23:05:24,707 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 23:05:24,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 23:05:24,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 23:05:24,752 INFO L158 Benchmark]: Toolchain (without parser) took 2386.73ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 95.6MB in the beginning and 143.0MB in the end (delta: -47.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:24,752 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:24,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.73ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 83.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 23:05:24,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.11ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 81.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:05:24,753 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 80.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:24,753 INFO L158 Benchmark]: IcfgBuilder took 217.51ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 70.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 23:05:24,753 INFO L158 Benchmark]: BuchiAutomizer took 1798.14ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 70.2MB in the beginning and 145.1MB in the end (delta: -74.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 23:05:24,754 INFO L158 Benchmark]: Witness Printer took 49.10ms. Allocated memory is still 190.8MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 23:05:24,755 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.73ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 83.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.11ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 81.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 151.0MB. Free memory was 81.6MB in the beginning and 80.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 217.51ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 70.2MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1798.14ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 70.2MB in the beginning and 145.1MB in the end (delta: -74.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 49.10ms. Allocated memory is still 190.8MB. Free memory was 145.1MB in the beginning and 143.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -2 * v) + 1) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:2. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 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, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 20 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 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: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) 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: [L16] int v = 0; VAL [v=0] [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND TRUE v == 0 [L21] v = 1 VAL [v=1] Loop: [L17] COND TRUE __VERIFIER_nondet_bool() == 0 [L18] CALL __VERIFIER_assert(0 <= v) [L13] COND FALSE !(!(cond)) [L18] RET __VERIFIER_assert(0 <= v) [L19] CALL __VERIFIER_assert(v <= 1) [L13] COND FALSE !(!(cond)) [L19] RET __VERIFIER_assert(v <= 1) [L20] COND FALSE !(v == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 23:05:24,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)