./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product27.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d20064856c358ac34c15406fcd734cb6b5694fad7d43f4bd7014ec1cea8e62ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:48:09,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:48:09,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:48:09,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:48:09,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:48:09,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:48:09,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:48:09,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:48:09,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:48:09,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:48:09,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:48:09,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:48:09,403 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:48:09,403 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:48:09,403 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:48:09,403 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:48:09,403 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:48:09,403 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:48:09,403 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:48:09,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:48:09,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:48:09,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:48:09,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:48:09,405 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:48:09,405 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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-jdk21/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 -> d20064856c358ac34c15406fcd734cb6b5694fad7d43f4bd7014ec1cea8e62ba [2025-01-10 07:48:09,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:48:09,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:48:09,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:48:09,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:48:09,715 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:48:09,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product27.cil.c [2025-01-10 07:48:10,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/164865a66/fd06144435c64c12b9f1d9bdeeea2f04/FLAGce7ca5aa8 [2025-01-10 07:48:11,295 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:48:11,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product27.cil.c [2025-01-10 07:48:11,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/164865a66/fd06144435c64c12b9f1d9bdeeea2f04/FLAGce7ca5aa8 [2025-01-10 07:48:11,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/164865a66/fd06144435c64c12b9f1d9bdeeea2f04 [2025-01-10 07:48:11,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:48:11,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:48:11,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:48:11,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:48:11,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:48:11,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:11,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59df9dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11, skipping insertion in model container [2025-01-10 07:48:11,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:11,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:48:11,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:48:11,888 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:48:11,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-01-10 07:48:11,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [87] [2025-01-10 07:48:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [139] [2025-01-10 07:48:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [505] [2025-01-10 07:48:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [600] [2025-01-10 07:48:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [609] [2025-01-10 07:48:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [709] [2025-01-10 07:48:11,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [777] [2025-01-10 07:48:11,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:48:11,987 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:48:11,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11 WrapperNode [2025-01-10 07:48:11,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:48:11,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:48:11,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:48:11,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:48:11,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,030 INFO L138 Inliner]: procedures = 56, calls = 101, calls flagged for inlining = 54, calls inlined = 59, statements flattened = 368 [2025-01-10 07:48:12,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:48:12,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:48:12,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:48:12,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:48:12,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,067 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]. [2025-01-10 07:48:12,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:48:12,089 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:48:12,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:48:12,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:48:12,090 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (1/1) ... [2025-01-10 07:48:12,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:48:12,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:48:12,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:48:12,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:48:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:48:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:48:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:48:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:48:12,207 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:48:12,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:48:12,469 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-01-10 07:48:12,470 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:48:12,486 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:48:12,486 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 07:48:12,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:48:12 BoogieIcfgContainer [2025-01-10 07:48:12,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:48:12,488 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:48:12,488 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:48:12,492 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:48:12,493 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:48:12,493 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:48:11" (1/3) ... [2025-01-10 07:48:12,494 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b5399d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:48:12, skipping insertion in model container [2025-01-10 07:48:12,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:48:12,494 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:48:11" (2/3) ... [2025-01-10 07:48:12,494 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b5399d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:48:12, skipping insertion in model container [2025-01-10 07:48:12,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:48:12,495 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:48:12" (3/3) ... [2025-01-10 07:48:12,496 INFO L363 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product27.cil.c [2025-01-10 07:48:12,540 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:48:12,541 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:48:12,541 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:48:12,541 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:48:12,541 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:48:12,542 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:48:12,542 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:48:12,542 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:48:12,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 116 states have internal predecessors, (155), 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) [2025-01-10 07:48:12,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2025-01-10 07:48:12,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:12,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:12,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:12,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:12,577 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:48:12,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 116 states have internal predecessors, (155), 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) [2025-01-10 07:48:12,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2025-01-10 07:48:12,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:12,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:12,586 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:12,586 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:12,591 INFO L752 eck$LassoCheckResult]: Stem: "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(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1;" "main_#t~ret36#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0;" "assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:48:12,591 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet37#1;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet38#1;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet39#1;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret5#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__2_#t~ret5#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;assume { :end_inline_isPumpRunning } true;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret5#1;havoc __utac_acc__Specification5_spec__2_#t~ret5#1;" "havoc __utac_acc__Specification5_spec__2_#t~ret5#1;assume { :end_inline___utac_acc__Specification5_spec__2 } true;" "assume !(0 != ~pumpRunning~0);" "assume !(0 != ~systemActive~0);" "assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret6#1, __utac_acc__Specification5_spec__3_#t~ret7#1, __utac_acc__Specification5_spec__3_~tmp~0#1, __utac_acc__Specification5_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification5_spec__3_~tmp~0#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~6#1;havoc getWaterLevel_~retValue_acc~6#1;getWaterLevel_~retValue_acc~6#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~6#1;" "__utac_acc__Specification5_spec__3_#t~ret6#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~6#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification5_spec__3_~tmp~0#1 := __utac_acc__Specification5_spec__3_#t~ret6#1;havoc __utac_acc__Specification5_spec__3_#t~ret6#1;" "assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0#1);" "havoc __utac_acc__Specification5_spec__3_#t~ret6#1, __utac_acc__Specification5_spec__3_#t~ret7#1, __utac_acc__Specification5_spec__3_~tmp~0#1, __utac_acc__Specification5_spec__3_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification5_spec__3 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:48:12,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:12,596 INFO L85 PathProgramCache]: Analyzing trace with hash 87859946, now seen corresponding path program 1 times [2025-01-10 07:48:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664978995] [2025-01-10 07:48:12,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:12,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:12,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:12,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:12,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:12,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:12,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:12,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:12,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2089865346, now seen corresponding path program 1 times [2025-01-10 07:48:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869359701] [2025-01-10 07:48:12,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:12,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:48:12,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:48:12,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:12,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:12,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:48:12,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:48:12,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:12,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:12,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1469160373, now seen corresponding path program 1 times [2025-01-10 07:48:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076482752] [2025-01-10 07:48:12,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:12,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 07:48:12,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 07:48:12,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:12,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:48:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:48:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:48:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076482752] [2025-01-10 07:48:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076482752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:48:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:48:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:48:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297082770] [2025-01-10 07:48:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:48:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:48:13,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:48:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:48:13,147 INFO L87 Difference]: Start difference. First operand has 117 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 116 states have internal predecessors, (155), 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 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 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) [2025-01-10 07:48:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:48:13,271 INFO L93 Difference]: Finished difference Result 285 states and 366 transitions. [2025-01-10 07:48:13,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 366 transitions. [2025-01-10 07:48:13,282 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 179 [2025-01-10 07:48:13,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 255 states and 336 transitions. [2025-01-10 07:48:13,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2025-01-10 07:48:13,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255 [2025-01-10 07:48:13,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 336 transitions. [2025-01-10 07:48:13,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:48:13,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 255 states and 336 transitions. [2025-01-10 07:48:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 336 transitions. [2025-01-10 07:48:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 160. [2025-01-10 07:48:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 160 states have (on average 1.31875) internal successors, (211), 159 states have internal predecessors, (211), 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) [2025-01-10 07:48:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2025-01-10 07:48:13,340 INFO L240 hiAutomatonCegarLoop]: Abstraction has 160 states and 211 transitions. [2025-01-10 07:48:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:48:13,344 INFO L432 stractBuchiCegarLoop]: Abstraction has 160 states and 211 transitions. [2025-01-10 07:48:13,344 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:48:13,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 211 transitions. [2025-01-10 07:48:13,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2025-01-10 07:48:13,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:13,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:13,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:13,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:13,348 INFO L752 eck$LassoCheckResult]: Stem: "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(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1;" "main_#t~ret36#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0;" "assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:48:13,348 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet37#1;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet38#1;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet39#1;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret5#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__2_#t~ret5#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;assume { :end_inline_isPumpRunning } true;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret5#1;havoc __utac_acc__Specification5_spec__2_#t~ret5#1;" "havoc __utac_acc__Specification5_spec__2_#t~ret5#1;assume { :end_inline___utac_acc__Specification5_spec__2 } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1;" "assume !(0 != ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret6#1, __utac_acc__Specification5_spec__3_#t~ret7#1, __utac_acc__Specification5_spec__3_~tmp~0#1, __utac_acc__Specification5_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification5_spec__3_~tmp~0#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~6#1;havoc getWaterLevel_~retValue_acc~6#1;getWaterLevel_~retValue_acc~6#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~6#1;" "__utac_acc__Specification5_spec__3_#t~ret6#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~6#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification5_spec__3_~tmp~0#1 := __utac_acc__Specification5_spec__3_#t~ret6#1;havoc __utac_acc__Specification5_spec__3_#t~ret6#1;" "assume !(2 != __utac_acc__Specification5_spec__3_~tmp~0#1);" "havoc __utac_acc__Specification5_spec__3_#t~ret6#1, __utac_acc__Specification5_spec__3_#t~ret7#1, __utac_acc__Specification5_spec__3_~tmp~0#1, __utac_acc__Specification5_spec__3_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification5_spec__3 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:48:13,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 87859946, now seen corresponding path program 2 times [2025-01-10 07:48:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773261491] [2025-01-10 07:48:13,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:48:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:13,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:13,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:13,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:48:13,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:13,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:13,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:13,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1364890820, now seen corresponding path program 1 times [2025-01-10 07:48:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:13,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344951360] [2025-01-10 07:48:13,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:13,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:48:13,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:48:13,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,412 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:13,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 07:48:13,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 07:48:13,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:13,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1557550803, now seen corresponding path program 1 times [2025-01-10 07:48:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498373114] [2025-01-10 07:48:13,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:13,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:13,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 07:48:13,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 07:48:13,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:48:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:48:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:48:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498373114] [2025-01-10 07:48:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498373114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:48:13,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:48:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:48:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510982762] [2025-01-10 07:48:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:48:13,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:48:13,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:48:13,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:48:13,658 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. cyclomatic complexity: 54 Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) [2025-01-10 07:48:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:48:13,790 INFO L93 Difference]: Finished difference Result 312 states and 408 transitions. [2025-01-10 07:48:13,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 408 transitions. [2025-01-10 07:48:13,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 224 [2025-01-10 07:48:13,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 408 transitions. [2025-01-10 07:48:13,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2025-01-10 07:48:13,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2025-01-10 07:48:13,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 408 transitions. [2025-01-10 07:48:13,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:48:13,799 INFO L218 hiAutomatonCegarLoop]: Abstraction has 312 states and 408 transitions. [2025-01-10 07:48:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 408 transitions. [2025-01-10 07:48:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2025-01-10 07:48:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 306 states have (on average 1.2941176470588236) internal successors, (396), 305 states have internal predecessors, (396), 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) [2025-01-10 07:48:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2025-01-10 07:48:13,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 306 states and 396 transitions. [2025-01-10 07:48:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:48:13,812 INFO L432 stractBuchiCegarLoop]: Abstraction has 306 states and 396 transitions. [2025-01-10 07:48:13,812 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:48:13,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 306 states and 396 transitions. [2025-01-10 07:48:13,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 220 [2025-01-10 07:48:13,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:48:13,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:48:13,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:13,816 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:48:13,816 INFO L752 eck$LassoCheckResult]: Stem: "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(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true;" "assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true;" "assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1;" "main_#t~ret36#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1;" "assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0;" "assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:48:13,816 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet37#1;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1;" "assume !(0 != test_~tmp~5#1);" "havoc test_#t~nondet38#1;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1;" "assume !(0 != test_~tmp___0~1#1);" "havoc test_#t~nondet39#1;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret5#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__2_#t~ret5#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;assume { :end_inline_isPumpRunning } true;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret5#1;havoc __utac_acc__Specification5_spec__2_#t~ret5#1;" "havoc __utac_acc__Specification5_spec__2_#t~ret5#1;assume { :end_inline___utac_acc__Specification5_spec__2 } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1;" "assume !(0 != ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret6#1, __utac_acc__Specification5_spec__3_#t~ret7#1, __utac_acc__Specification5_spec__3_~tmp~0#1, __utac_acc__Specification5_spec__3_~tmp___0~0#1;havoc __utac_acc__Specification5_spec__3_~tmp~0#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~6#1;havoc getWaterLevel_~retValue_acc~6#1;getWaterLevel_~retValue_acc~6#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~6#1;" "__utac_acc__Specification5_spec__3_#t~ret6#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~6#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification5_spec__3_~tmp~0#1 := __utac_acc__Specification5_spec__3_#t~ret6#1;havoc __utac_acc__Specification5_spec__3_#t~ret6#1;" "assume 2 != __utac_acc__Specification5_spec__3_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1;" "__utac_acc__Specification5_spec__3_#t~ret7#1 := isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification5_spec__3_~tmp___0~0#1 := __utac_acc__Specification5_spec__3_#t~ret7#1;havoc __utac_acc__Specification5_spec__3_#t~ret7#1;" "assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0#1);" "havoc __utac_acc__Specification5_spec__3_#t~ret6#1, __utac_acc__Specification5_spec__3_#t~ret7#1, __utac_acc__Specification5_spec__3_~tmp~0#1, __utac_acc__Specification5_spec__3_~tmp___0~0#1;assume { :end_inline___utac_acc__Specification5_spec__3 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:48:13,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash 87859946, now seen corresponding path program 3 times [2025-01-10 07:48:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032289540] [2025-01-10 07:48:13,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:48:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:13,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:13,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:13,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:48:13,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:13,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:13,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:13,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:13,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1674047679, now seen corresponding path program 1 times [2025-01-10 07:48:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:13,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190804271] [2025-01-10 07:48:13,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:13,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:13,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:48:13,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:48:13,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:13,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 07:48:13,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 07:48:13,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:48:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2116259560, now seen corresponding path program 1 times [2025-01-10 07:48:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:48:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156763066] [2025-01-10 07:48:13,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:48:13,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:48:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 07:48:13,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:48:13,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:13,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 07:48:13,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 07:48:13,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:13,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:13,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:48:14,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:14,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:14,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:14,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:14,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:48:14,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 07:48:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 07:48:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:48:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:48:14,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:48:14 BoogieIcfgContainer [2025-01-10 07:48:14,804 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:48:14,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:48:14,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:48:14,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:48:14,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:48:12" (3/4) ... [2025-01-10 07:48:14,806 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:48:14,849 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:48:14,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:48:14,850 INFO L158 Benchmark]: Toolchain (without parser) took 3305.54ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 49.9MB in the end (delta: 82.2MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2025-01-10 07:48:14,850 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 192.9MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:48:14,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.98ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 113.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:48:14,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.55ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 111.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:48:14,853 INFO L158 Benchmark]: Boogie Preprocessor took 56.79ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:48:14,853 INFO L158 Benchmark]: RCFGBuilder took 397.98ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 89.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:48:14,853 INFO L158 Benchmark]: BuchiAutomizer took 2316.19ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 53.8MB in the end (delta: 35.4MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2025-01-10 07:48:14,853 INFO L158 Benchmark]: Witness Printer took 44.98ms. Allocated memory is still 167.8MB. Free memory was 53.8MB in the beginning and 49.9MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:48:14,855 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.35ms. Allocated memory is still 192.9MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.98ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 113.7MB in the end (delta: 18.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.55ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 111.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.79ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 397.98ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 89.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2316.19ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 53.8MB in the end (delta: 35.4MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Witness Printer took 44.98ms. Allocated memory is still 167.8MB. Free memory was 53.8MB in the beginning and 49.9MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [87] - GenericResultAtLocation [Line: 139]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [139] - GenericResultAtLocation [Line: 505]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [505] - GenericResultAtLocation [Line: 600]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [600] - GenericResultAtLocation [Line: 609]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [609] - GenericResultAtLocation [Line: 709]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [709] - GenericResultAtLocation [Line: 777]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [777] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 306 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 101 StatesRemovedByMinimization, 2 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 1171 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 881 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 290 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 723]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L91] int switchedOnBeforeTS ; [L309] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L512] int waterLevel = 1; [L513] int methaneLevelCritical = 0; [L610] int cleanupTimeShifts = 4; [L780] int pumpRunning = 0; [L781] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L687] int retValue_acc ; [L688] int tmp ; [L692] FCALL select_helpers() [L693] FCALL select_features() [L694] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L694] RET, EXPR valid_product() [L694] tmp = valid_product() [L696] COND TRUE \read(tmp) [L698] FCALL setup() [L699] CALL runTest() [L680] CALL __utac_acc__Specification5_spec__1() [L96] switchedOnBeforeTS = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L680] RET __utac_acc__Specification5_spec__1() [L681] CALL test() [L712] int splverifierCounter ; [L713] int tmp ; [L714] int tmp___0 ; [L715] int tmp___1 ; [L716] int tmp___2 ; [L719] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] Loop: [L723] COND TRUE splverifierCounter < 4 [L729] tmp = __VERIFIER_nondet_int() [L731] COND FALSE !(\read(tmp)) [L739] tmp___0 = __VERIFIER_nondet_int() [L741] COND FALSE !(\read(tmp___0)) [L749] tmp___2 = __VERIFIER_nondet_int() [L751] COND TRUE \read(tmp___2) [L766] CALL timeShift() [L788] CALL __utac_acc__Specification5_spec__2() [L105] CALL, EXPR isPumpRunning() [L889] int retValue_acc ; [L892] retValue_acc = pumpRunning [L893] return (retValue_acc); [L105] RET, EXPR isPumpRunning() [L105] switchedOnBeforeTS = isPumpRunning() [L788] RET __utac_acc__Specification5_spec__2() [L790] COND FALSE !(\read(pumpRunning)) [L797] COND TRUE \read(systemActive) [L799] CALL processEnvironment() [L819] int tmp ; [L822] COND FALSE !(\read(pumpRunning)) [L837] FCALL processEnvironment__wrappee__base() [L799] RET processEnvironment() [L805] CALL __utac_acc__Specification5_spec__3() [L111] int tmp ; [L112] int tmp___0 ; [L116] CALL, EXPR getWaterLevel() [L583] int retValue_acc ; [L586] retValue_acc = waterLevel [L587] return (retValue_acc); [L116] RET, EXPR getWaterLevel() [L116] tmp = getWaterLevel() [L118] COND TRUE tmp != 2 [L120] CALL, EXPR isPumpRunning() [L889] int retValue_acc ; [L892] retValue_acc = pumpRunning [L893] return (retValue_acc); [L120] RET, EXPR isPumpRunning() [L120] tmp___0 = isPumpRunning() [L122] COND FALSE !(\read(tmp___0)) [L805] RET __utac_acc__Specification5_spec__3() [L766] RET timeShift() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 723]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L91] int switchedOnBeforeTS ; [L309] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L512] int waterLevel = 1; [L513] int methaneLevelCritical = 0; [L610] int cleanupTimeShifts = 4; [L780] int pumpRunning = 0; [L781] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L687] int retValue_acc ; [L688] int tmp ; [L692] FCALL select_helpers() [L693] FCALL select_features() [L694] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L694] RET, EXPR valid_product() [L694] tmp = valid_product() [L696] COND TRUE \read(tmp) [L698] FCALL setup() [L699] CALL runTest() [L680] CALL __utac_acc__Specification5_spec__1() [L96] switchedOnBeforeTS = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] [L680] RET __utac_acc__Specification5_spec__1() [L681] CALL test() [L712] int splverifierCounter ; [L713] int tmp ; [L714] int tmp___0 ; [L715] int tmp___1 ; [L716] int tmp___2 ; [L719] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, switchedOnBeforeTS=0, systemActive=1, waterLevel=1] Loop: [L723] COND TRUE splverifierCounter < 4 [L729] tmp = __VERIFIER_nondet_int() [L731] COND FALSE !(\read(tmp)) [L739] tmp___0 = __VERIFIER_nondet_int() [L741] COND FALSE !(\read(tmp___0)) [L749] tmp___2 = __VERIFIER_nondet_int() [L751] COND TRUE \read(tmp___2) [L766] CALL timeShift() [L788] CALL __utac_acc__Specification5_spec__2() [L105] CALL, EXPR isPumpRunning() [L889] int retValue_acc ; [L892] retValue_acc = pumpRunning [L893] return (retValue_acc); [L105] RET, EXPR isPumpRunning() [L105] switchedOnBeforeTS = isPumpRunning() [L788] RET __utac_acc__Specification5_spec__2() [L790] COND FALSE !(\read(pumpRunning)) [L797] COND TRUE \read(systemActive) [L799] CALL processEnvironment() [L819] int tmp ; [L822] COND FALSE !(\read(pumpRunning)) [L837] FCALL processEnvironment__wrappee__base() [L799] RET processEnvironment() [L805] CALL __utac_acc__Specification5_spec__3() [L111] int tmp ; [L112] int tmp___0 ; [L116] CALL, EXPR getWaterLevel() [L583] int retValue_acc ; [L586] retValue_acc = waterLevel [L587] return (retValue_acc); [L116] RET, EXPR getWaterLevel() [L116] tmp = getWaterLevel() [L118] COND TRUE tmp != 2 [L120] CALL, EXPR isPumpRunning() [L889] int retValue_acc ; [L892] retValue_acc = pumpRunning [L893] return (retValue_acc); [L120] RET, EXPR isPumpRunning() [L120] tmp___0 = isPumpRunning() [L122] COND FALSE !(\read(tmp___0)) [L805] RET __utac_acc__Specification5_spec__3() [L766] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:48:14,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)