./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product10.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_spec3_product10.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 00ac86131dc0e0af1cc82efd839ee9faae2b8444f182d9d05eed34c82369a7f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:46:30,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:46:30,762 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:46:30,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:46:30,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:46:30,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:46:30,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:46:30,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:46:30,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:46:30,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:46:30,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:46:30,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:46:30,791 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:46:30,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:46:30,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:46:30,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:46:30,792 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:46:30,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:46:30,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:46:30,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:46:30,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:46:30,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:46:30,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:46:30,792 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:46:30,792 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 -> 00ac86131dc0e0af1cc82efd839ee9faae2b8444f182d9d05eed34c82369a7f5 [2025-01-10 07:46:31,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:46:31,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:46:31,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:46:31,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:46:31,025 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:46:31,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product10.cil.c [2025-01-10 07:46:32,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2143bfc9/79a8d7df0d9c4348bbe3256138c436b3/FLAG4cc7607a5 [2025-01-10 07:46:32,393 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:46:32,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product10.cil.c [2025-01-10 07:46:32,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2143bfc9/79a8d7df0d9c4348bbe3256138c436b3/FLAG4cc7607a5 [2025-01-10 07:46:32,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2143bfc9/79a8d7df0d9c4348bbe3256138c436b3 [2025-01-10 07:46:32,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:46:32,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:46:32,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:46:32,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:46:32,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:46:32,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:46:32" (1/1) ... [2025-01-10 07:46:32,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6666572a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:32, skipping insertion in model container [2025-01-10 07:46:32,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:46:32" (1/1) ... [2025-01-10 07:46:32,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:46:32,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:46:32,957 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:46:32,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-01-10 07:46:32,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [87] [2025-01-10 07:46:32,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [173] [2025-01-10 07:46:32,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [182] [2025-01-10 07:46:32,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [548] [2025-01-10 07:46:32,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [618] [2025-01-10 07:46:32,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [756] [2025-01-10 07:46:32,965 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [790] [2025-01-10 07:46:33,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:46:33,032 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:46:33,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33 WrapperNode [2025-01-10 07:46:33,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:46:33,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:46:33,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:46:33,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:46:33,041 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:46:33" (1/1) ... [2025-01-10 07:46:33,054 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:46:33" (1/1) ... [2025-01-10 07:46:33,069 INFO L138 Inliner]: procedures = 51, calls = 93, calls flagged for inlining = 46, calls inlined = 39, statements flattened = 258 [2025-01-10 07:46:33,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:46:33,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:46:33,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:46:33,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:46:33,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,094 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:46:33,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:46:33,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:46:33,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:46:33,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:46:33,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (1/1) ... [2025-01-10 07:46:33,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:46:33,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:46:33,129 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:46:33,134 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:46:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:46:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:46:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:46:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:46:33,201 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:46:33,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:46:33,402 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-01-10 07:46:33,402 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:46:33,409 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:46:33,409 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 07:46:33,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:46:33 BoogieIcfgContainer [2025-01-10 07:46:33,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:46:33,410 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:46:33,410 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:46:33,413 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:46:33,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:46:33,414 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:46:32" (1/3) ... [2025-01-10 07:46:33,415 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e33ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:46:33, skipping insertion in model container [2025-01-10 07:46:33,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:46:33,415 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:46:33" (2/3) ... [2025-01-10 07:46:33,415 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e33ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:46:33, skipping insertion in model container [2025-01-10 07:46:33,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:46:33,415 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:46:33" (3/3) ... [2025-01-10 07:46:33,416 INFO L363 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product10.cil.c [2025-01-10 07:46:33,451 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:46:33,451 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:46:33,451 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:46:33,451 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:46:33,451 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:46:33,451 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:46:33,451 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:46:33,451 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:46:33,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 83 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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:46:33,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2025-01-10 07:46:33,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:46:33,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:46:33,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:46:33,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:46:33,476 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:46:33,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 83 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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:46:33,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2025-01-10 07:46:33,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:46:33,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:46:33,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:46:33,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:46:33,485 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret50#1, main_~retValue_acc~9#1, main_~tmp~6#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~6#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~ret50#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret50#1;havoc main_#t~ret50#1;" "assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet33#1, test_#t~nondet34#1, test_#t~nondet35#1, test_#t~nondet36#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:46:33,485 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet33#1;test_~tmp~3#1 := test_#t~nondet33#1;havoc test_#t~nondet33#1;" "assume !(0 != test_~tmp~3#1);" "havoc test_#t~nondet34#1;test_~tmp___0~0#1 := test_#t~nondet34#1;havoc test_#t~nondet34#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet35#1;test_~tmp___2~0#1 := test_#t~nondet35#1;havoc test_#t~nondet35#1;" "assume !(0 != test_~tmp___2~0#1);havoc test_#t~nondet36#1;test_~tmp___1~0#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume 0 != test_~tmp___1~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume !(0 != ~systemActive~0);" "assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret47#1, __utac_acc__Specification3_spec__1_#t~ret48#1, __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_~tmp~5#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~5#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;isMethaneLevelCritical_~retValue_acc~2#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~2#1;" "__utac_acc__Specification3_spec__1_#t~ret47#1 := isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification3_spec__1_~tmp~5#1 := __utac_acc__Specification3_spec__1_#t~ret47#1;havoc __utac_acc__Specification3_spec__1_#t~ret47#1;" "assume 0 != __utac_acc__Specification3_spec__1_~tmp~5#1;" "havoc __utac_acc__Specification3_spec__1_#t~ret47#1, __utac_acc__Specification3_spec__1_#t~ret48#1, __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_~tmp~5#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;assume { :end_inline___utac_acc__Specification3_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:46:33,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:33,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 1 times [2025-01-10 07:46:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041634177] [2025-01-10 07:46:33,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:33,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:33,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:33,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:33,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:33,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:33,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:33,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:33,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2008391968, now seen corresponding path program 1 times [2025-01-10 07:46:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508391786] [2025-01-10 07:46:33,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:33,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:46:33,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:46:33,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:33,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:33,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:33,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 07:46:33,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 07:46:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:33,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:33,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:33,597 INFO L85 PathProgramCache]: Analyzing trace with hash -652972892, now seen corresponding path program 1 times [2025-01-10 07:46:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40722461] [2025-01-10 07:46:33,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:33,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 07:46:33,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 07:46:33,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:33,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:46:33,761 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:46:33,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:46:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40722461] [2025-01-10 07:46:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40722461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:46:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:46:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 07:46:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908585738] [2025-01-10 07:46:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:46:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:46:33,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 07:46:33,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 07:46:33,861 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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:46:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:46:33,936 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2025-01-10 07:46:33,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 96 transitions. [2025-01-10 07:46:33,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2025-01-10 07:46:33,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 67 states and 86 transitions. [2025-01-10 07:46:33,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-01-10 07:46:33,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-01-10 07:46:33,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2025-01-10 07:46:33,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:46:33,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-01-10 07:46:33,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2025-01-10 07:46:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-10 07:46:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 66 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:46:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-01-10 07:46:33,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-01-10 07:46:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:46:33,978 INFO L432 stractBuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-01-10 07:46:33,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:46:33,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 86 transitions. [2025-01-10 07:46:33,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2025-01-10 07:46:33,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:46:33,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:46:33,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:46:33,981 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:46:33,981 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret50#1, main_~retValue_acc~9#1, main_~tmp~6#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~6#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~ret50#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret50#1;havoc main_#t~ret50#1;" "assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet33#1, test_#t~nondet34#1, test_#t~nondet35#1, test_#t~nondet36#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:46:33,981 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet33#1;test_~tmp~3#1 := test_#t~nondet33#1;havoc test_#t~nondet33#1;" "assume !(0 != test_~tmp~3#1);" "havoc test_#t~nondet34#1;test_~tmp___0~0#1 := test_#t~nondet34#1;havoc test_#t~nondet34#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet35#1;test_~tmp___2~0#1 := test_#t~nondet35#1;havoc test_#t~nondet35#1;" "assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1;" "assume { :end_inline_startSystem } true;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;" "assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret47#1, __utac_acc__Specification3_spec__1_#t~ret48#1, __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_~tmp~5#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~5#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;isMethaneLevelCritical_~retValue_acc~2#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~2#1;" "__utac_acc__Specification3_spec__1_#t~ret47#1 := isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification3_spec__1_~tmp~5#1 := __utac_acc__Specification3_spec__1_#t~ret47#1;havoc __utac_acc__Specification3_spec__1_#t~ret47#1;" "assume 0 != __utac_acc__Specification3_spec__1_~tmp~5#1;" "havoc __utac_acc__Specification3_spec__1_#t~ret47#1, __utac_acc__Specification3_spec__1_#t~ret48#1, __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_~tmp~5#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;assume { :end_inline___utac_acc__Specification3_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:46:33,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 2 times [2025-01-10 07:46:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:33,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261814055] [2025-01-10 07:46:33,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:46:33,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:33,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:33,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:33,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:46:33,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:33,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:33,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:34,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:34,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:34,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1921695866, now seen corresponding path program 1 times [2025-01-10 07:46:34,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834042841] [2025-01-10 07:46:34,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:34,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:46:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:46:34,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:34,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 07:46:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 07:46:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:34,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1441589826, now seen corresponding path program 1 times [2025-01-10 07:46:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:34,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977327163] [2025-01-10 07:46:34,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:34,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 07:46:34,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 07:46:34,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:46:34,155 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:46:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:46:34,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977327163] [2025-01-10 07:46:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977327163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:46:34,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:46:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 07:46:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2616834] [2025-01-10 07:46:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:46:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:46:34,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 07:46:34,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 07:46:34,220 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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:46:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:46:34,289 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2025-01-10 07:46:34,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 161 transitions. [2025-01-10 07:46:34,292 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 90 [2025-01-10 07:46:34,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 127 states and 161 transitions. [2025-01-10 07:46:34,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2025-01-10 07:46:34,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2025-01-10 07:46:34,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 161 transitions. [2025-01-10 07:46:34,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:46:34,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 127 states and 161 transitions. [2025-01-10 07:46:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 161 transitions. [2025-01-10 07:46:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-10 07:46:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 126 states have internal predecessors, (161), 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:46:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2025-01-10 07:46:34,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 161 transitions. [2025-01-10 07:46:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 07:46:34,303 INFO L432 stractBuchiCegarLoop]: Abstraction has 127 states and 161 transitions. [2025-01-10 07:46:34,303 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:46:34,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 161 transitions. [2025-01-10 07:46:34,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 90 [2025-01-10 07:46:34,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:46:34,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:46:34,306 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 07:46:34,306 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] [2025-01-10 07:46:34,306 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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret50#1, main_~retValue_acc~9#1, main_~tmp~6#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~6#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~ret50#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret50#1;havoc main_#t~ret50#1;" "assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true;" "assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet33#1, test_#t~nondet34#1, test_#t~nondet35#1, test_#t~nondet36#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0;" [2025-01-10 07:46:34,306 INFO L754 eck$LassoCheckResult]: Loop: "assume test_~splverifierCounter~0#1 < 4;" "havoc test_#t~nondet33#1;test_~tmp~3#1 := test_#t~nondet33#1;havoc test_#t~nondet33#1;" "assume !(0 != test_~tmp~3#1);" "havoc test_#t~nondet34#1;test_~tmp___0~0#1 := test_#t~nondet34#1;havoc test_#t~nondet34#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet35#1;test_~tmp___2~0#1 := test_#t~nondet35#1;havoc test_#t~nondet35#1;" "assume !(0 != test_~tmp___2~0#1);havoc test_#t~nondet36#1;test_~tmp___1~0#1 := test_#t~nondet36#1;havoc test_#t~nondet36#1;" "assume 0 != test_~tmp___1~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;" "assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret47#1, __utac_acc__Specification3_spec__1_#t~ret48#1, __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_~tmp~5#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~5#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~1#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;isMethaneLevelCritical_~retValue_acc~2#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~2#1;" "__utac_acc__Specification3_spec__1_#t~ret47#1 := isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~2#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification3_spec__1_~tmp~5#1 := __utac_acc__Specification3_spec__1_#t~ret47#1;havoc __utac_acc__Specification3_spec__1_#t~ret47#1;" "assume !(0 != __utac_acc__Specification3_spec__1_~tmp~5#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~3#1;havoc getWaterLevel_~retValue_acc~3#1;getWaterLevel_~retValue_acc~3#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~3#1;" "__utac_acc__Specification3_spec__1_#t~ret48#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~3#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~1#1 := __utac_acc__Specification3_spec__1_#t~ret48#1;havoc __utac_acc__Specification3_spec__1_#t~ret48#1;" "assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~1#1);" "havoc __utac_acc__Specification3_spec__1_#t~ret47#1, __utac_acc__Specification3_spec__1_#t~ret48#1, __utac_acc__Specification3_spec__1_#t~ret49#1, __utac_acc__Specification3_spec__1_~tmp~5#1, __utac_acc__Specification3_spec__1_~tmp___0~1#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;assume { :end_inline___utac_acc__Specification3_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-01-10 07:46:34,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 3 times [2025-01-10 07:46:34,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:34,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031156292] [2025-01-10 07:46:34,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 07:46:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:34,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:34,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:34,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 07:46:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:34,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:34,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:34,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:34,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -440797638, now seen corresponding path program 1 times [2025-01-10 07:46:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089741305] [2025-01-10 07:46:34,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:34,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:46:34,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:46:34,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,333 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:34,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 07:46:34,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 07:46:34,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:34,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:46:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1861345782, now seen corresponding path program 1 times [2025-01-10 07:46:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:46:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923110040] [2025-01-10 07:46:34,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:46:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:46:34,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 07:46:34,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:46:34,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:34,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 07:46:34,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 07:46:34,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:46:34,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:34,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:34,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:34,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:46:34,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 07:46:34,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 07:46:34,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:46:34,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:46:35,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:46:35 BoogieIcfgContainer [2025-01-10 07:46:35,012 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:46:35,013 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:46:35,013 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:46:35,013 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:46:35,014 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:46:33" (3/4) ... [2025-01-10 07:46:35,015 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-01-10 07:46:35,060 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 07:46:35,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:46:35,061 INFO L158 Benchmark]: Toolchain (without parser) took 2328.62ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 75.5MB in the end (delta: 46.1MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-01-10 07:46:35,062 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:46:35,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.16ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 103.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:46:35,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.89ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:46:35,064 INFO L158 Benchmark]: Boogie Preprocessor took 37.22ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 99.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:46:35,065 INFO L158 Benchmark]: RCFGBuilder took 302.02ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 83.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:46:35,065 INFO L158 Benchmark]: BuchiAutomizer took 1602.22ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 79.5MB in the end (delta: 3.5MB). Peak memory consumption was 537.0kB. Max. memory is 16.1GB. [2025-01-10 07:46:35,065 INFO L158 Benchmark]: Witness Printer took 47.71ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 75.5MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:46:35,067 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.24ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.16ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 103.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.89ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.22ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 99.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 302.02ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 83.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1602.22ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 79.5MB in the end (delta: 3.5MB). Peak memory consumption was 537.0kB. Max. memory is 16.1GB. * Witness Printer took 47.71ms. Allocated memory is still 167.8MB. Free memory was 79.5MB in the beginning and 75.5MB in the end (delta: 4.0MB). There was no memory consumed. 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,"Environment.i","") [87] - GenericResultAtLocation [Line: 173]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [173] - GenericResultAtLocation [Line: 182]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [182] - GenericResultAtLocation [Line: 548]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [548] - GenericResultAtLocation [Line: 618]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [618] - GenericResultAtLocation [Line: 756]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [756] - GenericResultAtLocation [Line: 790]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [790] * 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 127 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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, 236 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 565 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 168 mSDtfsCounter, 60 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: 564]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L94] int waterLevel = 1; [L95] int methaneLevelCritical = 0; [L352] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L623] int pumpRunning = 0; [L624] int systemActive = 1; [L791] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L864] int retValue_acc ; [L865] int tmp ; [L869] FCALL select_helpers() [L870] FCALL select_features() [L871] 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, systemActive=1, waterLevel=1] [L871] RET, EXPR valid_product() [L871] tmp = valid_product() [L873] COND TRUE \read(tmp) [L875] FCALL setup() [L876] CALL runTest() [L858] CALL test() [L553] int splverifierCounter ; [L554] int tmp ; [L555] int tmp___0 ; [L556] int tmp___1 ; [L557] int tmp___2 ; [L560] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] Loop: [L564] COND TRUE splverifierCounter < 4 [L570] tmp = __VERIFIER_nondet_int() [L572] COND FALSE !(\read(tmp)) [L580] tmp___0 = __VERIFIER_nondet_int() [L582] COND FALSE !(\read(tmp___0)) [L590] tmp___2 = __VERIFIER_nondet_int() [L592] COND FALSE !(\read(tmp___2)) [L598] tmp___1 = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp___1) [L607] CALL timeShift() [L631] COND FALSE !(\read(pumpRunning)) [L638] COND TRUE \read(systemActive) [L640] FCALL processEnvironment() [L646] CALL __utac_acc__Specification3_spec__1() [L758] int tmp ; [L759] int tmp___0 ; [L760] int tmp___1 ; [L764] CALL, EXPR isMethaneLevelCritical() [L133] int retValue_acc ; [L136] retValue_acc = methaneLevelCritical [L137] return (retValue_acc); [L764] RET, EXPR isMethaneLevelCritical() [L764] tmp = isMethaneLevelCritical() [L766] COND FALSE !(\read(tmp)) [L770] CALL, EXPR getWaterLevel() [L165] int retValue_acc ; [L168] retValue_acc = waterLevel [L169] return (retValue_acc); [L770] RET, EXPR getWaterLevel() [L770] tmp___0 = getWaterLevel() [L772] COND FALSE !(tmp___0 == 2) [L646] RET __utac_acc__Specification3_spec__1() [L607] RET timeShift() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L94] int waterLevel = 1; [L95] int methaneLevelCritical = 0; [L352] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L623] int pumpRunning = 0; [L624] int systemActive = 1; [L791] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L864] int retValue_acc ; [L865] int tmp ; [L869] FCALL select_helpers() [L870] FCALL select_features() [L871] 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, systemActive=1, waterLevel=1] [L871] RET, EXPR valid_product() [L871] tmp = valid_product() [L873] COND TRUE \read(tmp) [L875] FCALL setup() [L876] CALL runTest() [L858] CALL test() [L553] int splverifierCounter ; [L554] int tmp ; [L555] int tmp___0 ; [L556] int tmp___1 ; [L557] int tmp___2 ; [L560] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] Loop: [L564] COND TRUE splverifierCounter < 4 [L570] tmp = __VERIFIER_nondet_int() [L572] COND FALSE !(\read(tmp)) [L580] tmp___0 = __VERIFIER_nondet_int() [L582] COND FALSE !(\read(tmp___0)) [L590] tmp___2 = __VERIFIER_nondet_int() [L592] COND FALSE !(\read(tmp___2)) [L598] tmp___1 = __VERIFIER_nondet_int() [L600] COND TRUE \read(tmp___1) [L607] CALL timeShift() [L631] COND FALSE !(\read(pumpRunning)) [L638] COND TRUE \read(systemActive) [L640] FCALL processEnvironment() [L646] CALL __utac_acc__Specification3_spec__1() [L758] int tmp ; [L759] int tmp___0 ; [L760] int tmp___1 ; [L764] CALL, EXPR isMethaneLevelCritical() [L133] int retValue_acc ; [L136] retValue_acc = methaneLevelCritical [L137] return (retValue_acc); [L764] RET, EXPR isMethaneLevelCritical() [L764] tmp = isMethaneLevelCritical() [L766] COND FALSE !(\read(tmp)) [L770] CALL, EXPR getWaterLevel() [L165] int retValue_acc ; [L168] retValue_acc = waterLevel [L169] return (retValue_acc); [L770] RET, EXPR getWaterLevel() [L770] tmp___0 = getWaterLevel() [L772] COND FALSE !(tmp___0 == 2) [L646] RET __utac_acc__Specification3_spec__1() [L607] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-01-10 07:46:35,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)