./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6014a53bc4531229002927c7dae6ceb41eaf1bcae6bbbe475b6c1299f7673d0b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 16:16:47,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 16:16:47,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 16:16:47,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 16:16:47,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 16:16:47,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 16:16:47,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 16:16:47,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 16:16:47,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 16:16:47,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 16:16:47,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 16:16:47,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 16:16:47,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 16:16:47,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 16:16:47,149 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 16:16:47,149 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 16:16:47,149 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 16:16:47,149 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 16:16:47,150 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 16:16:47,150 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 16:16:47,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 16:16:47,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 16:16:47,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 16:16:47,152 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 16:16:47,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 16:16:47,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 16:16:47,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 16:16:47,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 16:16:47,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 16:16:47,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 16:16:47,153 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 16:16:47,153 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/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 -> 6014a53bc4531229002927c7dae6ceb41eaf1bcae6bbbe475b6c1299f7673d0b [2025-03-04 16:16:47,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 16:16:47,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 16:16:47,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 16:16:47,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 16:16:47,413 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 16:16:47,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c [2025-03-04 16:16:48,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303e8a655/2d380bfcd94c461797bb55665fcc5005/FLAG7dd5aa385 [2025-03-04 16:16:48,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 16:16:48,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c [2025-03-04 16:16:48,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303e8a655/2d380bfcd94c461797bb55665fcc5005/FLAG7dd5aa385 [2025-03-04 16:16:48,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/303e8a655/2d380bfcd94c461797bb55665fcc5005 [2025-03-04 16:16:48,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 16:16:48,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 16:16:48,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 16:16:48,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 16:16:48,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 16:16:48,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:48,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f326f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:48, skipping insertion in model container [2025-03-04 16:16:48,985 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:16:48" (1/1) ... [2025-03-04 16:16:49,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 16:16:49,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:16:49,228 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 16:16:49,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [315] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [324] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [423] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [518] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [553] [2025-03-04 16:16:49,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [919] [2025-03-04 16:16:49,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 16:16:49,313 INFO L204 MainTranslator]: Completed translation [2025-03-04 16:16:49,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49 WrapperNode [2025-03-04 16:16:49,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 16:16:49,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 16:16:49,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 16:16:49,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 16:16:49,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,350 INFO L138 Inliner]: procedures = 54, calls = 98, calls flagged for inlining = 51, calls inlined = 61, statements flattened = 403 [2025-03-04 16:16:49,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 16:16:49,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 16:16:49,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 16:16:49,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 16:16:49,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,378 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-03-04 16:16:49,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 16:16:49,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 16:16:49,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 16:16:49,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 16:16:49,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (1/1) ... [2025-03-04 16:16:49,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 16:16:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 16:16:49,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 16:16:49,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 16:16:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 16:16:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 16:16:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 16:16:49,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 16:16:49,507 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 16:16:49,509 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 16:16:49,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L515-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2025-03-04 16:16:49,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L515-3: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2025-03-04 16:16:49,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L515-5: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2025-03-04 16:16:49,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L550-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L501-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L501-3: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L501-5: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L469-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~4#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L469-3: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~4#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L469-5: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~4#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L420-1: main_#res#1 := main_~retValue_acc~3#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L242-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-03-04 16:16:49,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L242-3: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-03-04 16:16:49,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L242-5: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-03-04 16:16:49,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-03-04 16:16:49,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297-3: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-03-04 16:16:49,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297-5: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-03-04 16:16:49,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L233-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~0#1; [2025-03-04 16:16:49,796 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L233-3: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~0#1; [2025-03-04 16:16:49,796 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L233-5: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~0#1; [2025-03-04 16:16:49,817 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 16:16:49,817 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 16:16:49,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 16:16:49,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 16:16:49,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:16:49 BoogieIcfgContainer [2025-03-04 16:16:49,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 16:16:49,830 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 16:16:49,830 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 16:16:49,834 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 16:16:49,835 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:16:49,835 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 04:16:48" (1/3) ... [2025-03-04 16:16:49,837 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36241b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:16:49, skipping insertion in model container [2025-03-04 16:16:49,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:16:49,838 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:16:49" (2/3) ... [2025-03-04 16:16:49,838 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36241b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 04:16:49, skipping insertion in model container [2025-03-04 16:16:49,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 16:16:49,838 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:16:49" (3/3) ... [2025-03-04 16:16:49,839 INFO L363 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product43.cil.c [2025-03-04 16:16:49,877 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 16:16:49,877 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 16:16:49,878 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 16:16:49,878 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 16:16:49,878 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 16:16:49,878 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 16:16:49,878 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 16:16:49,878 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 16:16:49,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 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-03-04 16:16:49,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 78 [2025-03-04 16:16:49,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:49,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:49,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,906 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 16:16:49,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 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-03-04 16:16:49,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 78 [2025-03-04 16:16:49,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:49,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:49,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:49,918 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);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret20#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#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~8#1;havoc valid_product_~retValue_acc~8#1;valid_product_~retValue_acc~8#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~8#1;" "main_#t~ret20#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~8#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret20#1;havoc main_#t~ret20#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_test } true;havoc test_#t~nondet4#1, test_#t~nondet5#1, test_#t~nondet6#1, test_#t~nondet7#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#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-03-04 16:16:49,918 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet4#1;test_~tmp~0#1 := test_#t~nondet4#1;havoc test_#t~nondet4#1;" "assume !(0 != test_~tmp~0#1);" "havoc test_#t~nondet5#1;test_~tmp___0~0#1 := test_#t~nondet5#1;havoc test_#t~nondet5#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet6#1;test_~tmp___2~0#1 := test_#t~nondet6#1;havoc test_#t~nondet6#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume !(0 != ~systemActive~0);" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~8#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;havoc getWaterLevel_~retValue_acc~5#1;getWaterLevel_~retValue_acc~5#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1;" "__utac_acc__Specification4_spec__1_#t~ret50#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~8#1 := __utac_acc__Specification4_spec__1_#t~ret50#1;havoc __utac_acc__Specification4_spec__1_#t~ret50#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:49,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1760382370, now seen corresponding path program 1 times [2025-03-04 16:16:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261758543] [2025-03-04 16:16:49,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:49,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:49,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:49,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:49,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2094700024, now seen corresponding path program 1 times [2025-03-04 16:16:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685870480] [2025-03-04 16:16:50,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:16:50,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:16:50,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 16:16:50,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 16:16:50,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1058080327, now seen corresponding path program 1 times [2025-03-04 16:16:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551140629] [2025-03-04 16:16:50,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 16:16:50,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 16:16:50,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:50,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551140629] [2025-03-04 16:16:50,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551140629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:50,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:50,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 16:16:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658419399] [2025-03-04 16:16:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:50,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:16:50,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:16:50,277 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-03-04 16:16:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:50,316 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2025-03-04 16:16:50,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 292 transitions. [2025-03-04 16:16:50,324 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2025-03-04 16:16:50,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 204 states and 271 transitions. [2025-03-04 16:16:50,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 204 [2025-03-04 16:16:50,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 204 [2025-03-04 16:16:50,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 271 transitions. [2025-03-04 16:16:50,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:50,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 204 states and 271 transitions. [2025-03-04 16:16:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 271 transitions. [2025-03-04 16:16:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2025-03-04 16:16:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.328358208955224) internal successors, (267), 200 states have internal predecessors, (267), 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-03-04 16:16:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2025-03-04 16:16:50,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 267 transitions. [2025-03-04 16:16:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:16:50,378 INFO L432 stractBuchiCegarLoop]: Abstraction has 201 states and 267 transitions. [2025-03-04 16:16:50,378 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 16:16:50,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 267 transitions. [2025-03-04 16:16:50,382 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 140 [2025-03-04 16:16:50,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:50,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:50,382 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:50,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:50,386 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);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret20#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#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~8#1;havoc valid_product_~retValue_acc~8#1;valid_product_~retValue_acc~8#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~8#1;" "main_#t~ret20#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~8#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret20#1;havoc main_#t~ret20#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_test } true;havoc test_#t~nondet4#1, test_#t~nondet5#1, test_#t~nondet6#1, test_#t~nondet7#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#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-03-04 16:16:50,386 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet4#1;test_~tmp~0#1 := test_#t~nondet4#1;havoc test_#t~nondet4#1;" "assume !(0 != test_~tmp~0#1);" "havoc test_#t~nondet5#1;test_~tmp___0~0#1 := test_#t~nondet5#1;havoc test_#t~nondet5#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet6#1;test_~tmp___2~0#1 := test_#t~nondet6#1;havoc test_#t~nondet6#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;havoc processEnvironment_~tmp~1#1;" "assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~8#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;havoc getWaterLevel_~retValue_acc~5#1;getWaterLevel_~retValue_acc~5#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1;" "__utac_acc__Specification4_spec__1_#t~ret50#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~8#1 := __utac_acc__Specification4_spec__1_#t~ret50#1;havoc __utac_acc__Specification4_spec__1_#t~ret50#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1760382370, now seen corresponding path program 2 times [2025-03-04 16:16:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74439819] [2025-03-04 16:16:50,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 16:16:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:16:50,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -984349732, now seen corresponding path program 1 times [2025-03-04 16:16:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498772934] [2025-03-04 16:16:50,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 16:16:50,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 16:16:50,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:50,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498772934] [2025-03-04 16:16:50,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498772934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:50,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 16:16:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283700381] [2025-03-04 16:16:50,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:50,428 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:16:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:50,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 16:16:50,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 16:16:50,429 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-03-04 16:16:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:50,496 INFO L93 Difference]: Finished difference Result 308 states and 397 transitions. [2025-03-04 16:16:50,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 308 states and 397 transitions. [2025-03-04 16:16:50,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 221 [2025-03-04 16:16:50,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 308 states to 308 states and 397 transitions. [2025-03-04 16:16:50,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 308 [2025-03-04 16:16:50,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2025-03-04 16:16:50,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 308 states and 397 transitions. [2025-03-04 16:16:50,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:50,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 308 states and 397 transitions. [2025-03-04 16:16:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states and 397 transitions. [2025-03-04 16:16:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-04 16:16:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 1.2889610389610389) internal successors, (397), 307 states have internal predecessors, (397), 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-03-04 16:16:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 397 transitions. [2025-03-04 16:16:50,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 308 states and 397 transitions. [2025-03-04 16:16:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 16:16:50,524 INFO L432 stractBuchiCegarLoop]: Abstraction has 308 states and 397 transitions. [2025-03-04 16:16:50,525 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 16:16:50,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 397 transitions. [2025-03-04 16:16:50,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 221 [2025-03-04 16:16:50,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:50,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:50,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:50,542 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, 1, 1] [2025-03-04 16:16:50,542 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);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret20#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#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~8#1;havoc valid_product_~retValue_acc~8#1;valid_product_~retValue_acc~8#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~8#1;" "main_#t~ret20#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~8#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret20#1;havoc main_#t~ret20#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_test } true;havoc test_#t~nondet4#1, test_#t~nondet5#1, test_#t~nondet6#1, test_#t~nondet7#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#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-03-04 16:16:50,542 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet4#1;test_~tmp~0#1 := test_#t~nondet4#1;havoc test_#t~nondet4#1;" "assume !(0 != test_~tmp~0#1);" "havoc test_#t~nondet5#1;test_~tmp___0~0#1 := test_#t~nondet5#1;havoc test_#t~nondet5#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet6#1;test_~tmp___2~0#1 := test_#t~nondet6#1;havoc test_#t~nondet6#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;havoc processEnvironment_~tmp~1#1;" "assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret19#1, isHighWaterLevel_~retValue_acc~2#1, isHighWaterLevel_~tmp~3#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~2#1;havoc isHighWaterLevel_~tmp~3#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;" "assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~6#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1;" "isHighWaterLevel_#t~ret19#1 := isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~3#1 := isHighWaterLevel_#t~ret19#1;havoc isHighWaterLevel_#t~ret19#1;" "assume 0 != isHighWaterLevel_~tmp~3#1;isHighWaterLevel_~tmp___0~1#1 := 0;" "isHighWaterLevel_~retValue_acc~2#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1;" "processEnvironment_#t~ret8#1 := isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret19#1, isHighWaterLevel_~retValue_acc~2#1, isHighWaterLevel_~tmp~3#1, isHighWaterLevel_~tmp___0~1#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~1#1 := processEnvironment_#t~ret8#1;havoc processEnvironment_#t~ret8#1;" "assume !(0 != processEnvironment_~tmp~1#1);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~8#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;havoc getWaterLevel_~retValue_acc~5#1;getWaterLevel_~retValue_acc~5#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1;" "__utac_acc__Specification4_spec__1_#t~ret50#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~8#1 := __utac_acc__Specification4_spec__1_#t~ret50#1;havoc __utac_acc__Specification4_spec__1_#t~ret50#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1760382370, now seen corresponding path program 3 times [2025-03-04 16:16:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139263958] [2025-03-04 16:16:50,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 16:16:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 16:16:50,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1083853909, now seen corresponding path program 1 times [2025-03-04 16:16:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193850228] [2025-03-04 16:16:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:16:50,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:16:50,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:50,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193850228] [2025-03-04 16:16:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193850228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:50,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 16:16:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299424415] [2025-03-04 16:16:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:50,636 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:16:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 16:16:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 16:16:50,637 INFO L87 Difference]: Start difference. First operand 308 states and 397 transitions. cyclomatic complexity: 93 Second operand has 4 states, 4 states have (on average 6.0) 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-03-04 16:16:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:50,680 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2025-03-04 16:16:50,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 409 transitions. [2025-03-04 16:16:50,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 229 [2025-03-04 16:16:50,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 320 states and 409 transitions. [2025-03-04 16:16:50,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2025-03-04 16:16:50,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2025-03-04 16:16:50,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 409 transitions. [2025-03-04 16:16:50,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:50,688 INFO L218 hiAutomatonCegarLoop]: Abstraction has 320 states and 409 transitions. [2025-03-04 16:16:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 409 transitions. [2025-03-04 16:16:50,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-04 16:16:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 320 states have (on average 1.278125) internal successors, (409), 319 states have internal predecessors, (409), 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-03-04 16:16:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 409 transitions. [2025-03-04 16:16:50,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 320 states and 409 transitions. [2025-03-04 16:16:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 16:16:50,709 INFO L432 stractBuchiCegarLoop]: Abstraction has 320 states and 409 transitions. [2025-03-04 16:16:50,709 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 16:16:50,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 320 states and 409 transitions. [2025-03-04 16:16:50,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 229 [2025-03-04 16:16:50,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:50,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:50,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:50,713 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, 1, 1] [2025-03-04 16:16:50,713 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);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret20#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#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~8#1;havoc valid_product_~retValue_acc~8#1;valid_product_~retValue_acc~8#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~8#1;" "main_#t~ret20#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~8#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret20#1;havoc main_#t~ret20#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_test } true;havoc test_#t~nondet4#1, test_#t~nondet5#1, test_#t~nondet6#1, test_#t~nondet7#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#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-03-04 16:16:50,713 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet4#1;test_~tmp~0#1 := test_#t~nondet4#1;havoc test_#t~nondet4#1;" "assume !(0 != test_~tmp~0#1);" "havoc test_#t~nondet5#1;test_~tmp___0~0#1 := test_#t~nondet5#1;havoc test_#t~nondet5#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet6#1;test_~tmp___2~0#1 := test_#t~nondet6#1;havoc test_#t~nondet6#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;havoc processEnvironment_~tmp~1#1;" "assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret19#1, isHighWaterLevel_~retValue_acc~2#1, isHighWaterLevel_~tmp~3#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~2#1;havoc isHighWaterLevel_~tmp~3#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;" "assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~6#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1;" "isHighWaterLevel_#t~ret19#1 := isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~3#1 := isHighWaterLevel_#t~ret19#1;havoc isHighWaterLevel_#t~ret19#1;" "assume !(0 != isHighWaterLevel_~tmp~3#1);isHighWaterLevel_~tmp___0~1#1 := 1;" "isHighWaterLevel_~retValue_acc~2#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1;" "processEnvironment_#t~ret8#1 := isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret19#1, isHighWaterLevel_~retValue_acc~2#1, isHighWaterLevel_~tmp~3#1, isHighWaterLevel_~tmp___0~1#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~1#1 := processEnvironment_#t~ret8#1;havoc processEnvironment_#t~ret8#1;" "assume !(0 != processEnvironment_~tmp~1#1);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~8#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;havoc getWaterLevel_~retValue_acc~5#1;getWaterLevel_~retValue_acc~5#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1;" "__utac_acc__Specification4_spec__1_#t~ret50#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~8#1 := __utac_acc__Specification4_spec__1_#t~ret50#1;havoc __utac_acc__Specification4_spec__1_#t~ret50#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1760382370, now seen corresponding path program 4 times [2025-03-04 16:16:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557937935] [2025-03-04 16:16:50,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 16:16:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,719 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 7 statements into 2 equivalence classes. [2025-03-04 16:16:50,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,723 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 16:16:50,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash -713097450, now seen corresponding path program 1 times [2025-03-04 16:16:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59219984] [2025-03-04 16:16:50,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:16:50,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:16:50,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 16:16:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 16:16:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 16:16:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59219984] [2025-03-04 16:16:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59219984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 16:16:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 16:16:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 16:16:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810481997] [2025-03-04 16:16:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 16:16:50,800 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-04 16:16:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 16:16:50,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 16:16:50,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 16:16:50,801 INFO L87 Difference]: Start difference. First operand 320 states and 409 transitions. cyclomatic complexity: 93 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-03-04 16:16:50,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 16:16:50,850 INFO L93 Difference]: Finished difference Result 338 states and 427 transitions. [2025-03-04 16:16:50,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 427 transitions. [2025-03-04 16:16:50,852 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 241 [2025-03-04 16:16:50,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 427 transitions. [2025-03-04 16:16:50,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2025-03-04 16:16:50,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2025-03-04 16:16:50,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 427 transitions. [2025-03-04 16:16:50,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 16:16:50,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 427 transitions. [2025-03-04 16:16:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 427 transitions. [2025-03-04 16:16:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-03-04 16:16:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.2633136094674555) internal successors, (427), 337 states have internal predecessors, (427), 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-03-04 16:16:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 427 transitions. [2025-03-04 16:16:50,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 427 transitions. [2025-03-04 16:16:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 16:16:50,864 INFO L432 stractBuchiCegarLoop]: Abstraction has 338 states and 427 transitions. [2025-03-04 16:16:50,865 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 16:16:50,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 427 transitions. [2025-03-04 16:16:50,866 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 241 [2025-03-04 16:16:50,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 16:16:50,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 16:16:50,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 16:16:50,866 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, 1, 1] [2025-03-04 16:16:50,866 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);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret20#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#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~8#1;havoc valid_product_~retValue_acc~8#1;valid_product_~retValue_acc~8#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~8#1;" "main_#t~ret20#1 := valid_product_#res#1;havoc valid_product_~retValue_acc~8#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret20#1;havoc main_#t~ret20#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_test } true;havoc test_#t~nondet4#1, test_#t~nondet5#1, test_#t~nondet6#1, test_#t~nondet7#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#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-03-04 16:16:50,867 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume test_~splverifierCounter~0#1 < 4;havoc test_#t~nondet4#1;test_~tmp~0#1 := test_#t~nondet4#1;havoc test_#t~nondet4#1;" "assume !(0 != test_~tmp~0#1);" "havoc test_#t~nondet5#1;test_~tmp___0~0#1 := test_#t~nondet5#1;havoc test_#t~nondet5#1;" "assume !(0 != test_~tmp___0~0#1);" "havoc test_#t~nondet6#1;test_~tmp___2~0#1 := test_#t~nondet6#1;havoc test_#t~nondet6#1;" "assume 0 != test_~tmp___2~0#1;" "assume { :begin_inline_timeShift } true;" "assume !(0 != ~pumpRunning~0);" "assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;havoc processEnvironment_~tmp~1#1;" "assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret19#1, isHighWaterLevel_~retValue_acc~2#1, isHighWaterLevel_~tmp~3#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~2#1;havoc isHighWaterLevel_~tmp~3#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;" "assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6#1 := 1;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1;" "isHighWaterLevel_#t~ret19#1 := isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~6#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~3#1 := isHighWaterLevel_#t~ret19#1;havoc isHighWaterLevel_#t~ret19#1;" "assume 0 != isHighWaterLevel_~tmp~3#1;isHighWaterLevel_~tmp___0~1#1 := 0;" "isHighWaterLevel_~retValue_acc~2#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1;" "processEnvironment_#t~ret8#1 := isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret19#1, isHighWaterLevel_~retValue_acc~2#1, isHighWaterLevel_~tmp~3#1, isHighWaterLevel_~tmp___0~1#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~1#1 := processEnvironment_#t~ret8#1;havoc processEnvironment_#t~ret8#1;" "assume !(0 != processEnvironment_~tmp~1#1);assume { :begin_inline_processEnvironment__wrappee__base } true;" "assume { :end_inline_processEnvironment__wrappee__base } true;" "havoc processEnvironment_#t~ret8#1, processEnvironment_~tmp~1#1;assume { :end_inline_processEnvironment } true;" "assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification4_spec__1_~tmp~8#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;havoc getWaterLevel_~retValue_acc~5#1;getWaterLevel_~retValue_acc~5#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1;" "__utac_acc__Specification4_spec__1_#t~ret50#1 := getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~5#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~8#1 := __utac_acc__Specification4_spec__1_#t~ret50#1;havoc __utac_acc__Specification4_spec__1_#t~ret50#1;" "assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8#1);" "havoc __utac_acc__Specification4_spec__1_#t~ret50#1, __utac_acc__Specification4_spec__1_#t~ret51#1, __utac_acc__Specification4_spec__1_~tmp~8#1, __utac_acc__Specification4_spec__1_~tmp___0~2#1;assume { :end_inline___utac_acc__Specification4_spec__1 } true;" "assume { :end_inline_timeShift } true;" [2025-03-04 16:16:50,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1760382370, now seen corresponding path program 5 times [2025-03-04 16:16:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533875780] [2025-03-04 16:16:50,867 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 16:16:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,874 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,876 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,876 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 16:16:50,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:50,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:50,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1670659923, now seen corresponding path program 1 times [2025-03-04 16:16:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104190435] [2025-03-04 16:16:50,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:16:50,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:16:50,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 16:16:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 16:16:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:50,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 16:16:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1089799692, now seen corresponding path program 1 times [2025-03-04 16:16:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 16:16:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385862366] [2025-03-04 16:16:50,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 16:16:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 16:16:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:16:50,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:16:50,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:50,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 16:16:50,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 16:16:50,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:50,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:50,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 16:16:51,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:51,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:51,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:51,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:51,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 16:16:51,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 16:16:51,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 16:16:51,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 16:16:51,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 16:16:51,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 04:16:51 BoogieIcfgContainer [2025-03-04 16:16:51,643 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 16:16:51,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 16:16:51,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 16:16:51,644 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 16:16:51,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:16:49" (3/4) ... [2025-03-04 16:16:51,646 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 16:16:51,681 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 16:16:51,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 16:16:51,683 INFO L158 Benchmark]: Toolchain (without parser) took 2704.33ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 57.2MB in the end (delta: 74.8MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2025-03-04 16:16:51,683 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:16:51,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 113.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:16:51,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.39ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 111.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 16:16:51,683 INFO L158 Benchmark]: Boogie Preprocessor took 39.41ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:16:51,683 INFO L158 Benchmark]: IcfgBuilder took 434.74ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 86.0MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 16:16:51,684 INFO L158 Benchmark]: BuchiAutomizer took 1813.55ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 60.8MB in the end (delta: 25.2MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2025-03-04 16:16:51,684 INFO L158 Benchmark]: Witness Printer took 37.15ms. Allocated memory is still 167.8MB. Free memory was 60.8MB in the beginning and 57.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 16:16:51,685 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 113.8MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.39ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 111.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.41ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 434.74ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 86.0MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1813.55ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 60.8MB in the end (delta: 25.2MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 37.15ms. Allocated memory is still 167.8MB. Free memory was 60.8MB in the beginning and 57.2MB in the end (delta: 3.6MB). 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 315]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [315] - GenericResultAtLocation [Line: 324]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [324] - GenericResultAtLocation [Line: 423]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [423] - GenericResultAtLocation [Line: 518]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [518] - GenericResultAtLocation [Line: 553]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [553] - GenericResultAtLocation [Line: 919]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [919] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 338 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 1401 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 840 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 561 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 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: 65]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L130] int pumpRunning = 0; [L131] int systemActive = 1; [L325] int cleanupTimeShifts = 4; [L425] int waterLevel = 1; [L426] int methaneLevelCritical = 0; [L723] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L401] int retValue_acc ; [L402] int tmp ; [L406] FCALL select_helpers() [L407] FCALL select_features() [L408] CALL, EXPR valid_product() [L545] int retValue_acc ; [L548] retValue_acc = 1 [L549] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L408] RET, EXPR valid_product() [L408] tmp = valid_product() [L410] COND TRUE \read(tmp) [L412] FCALL setup() [L413] CALL runTest() [L392] CALL test() [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] Loop: [L65] COND TRUE 1 [L67] COND TRUE splverifierCounter < 4 [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L110] CALL timeShift() [L138] COND FALSE !(\read(pumpRunning)) [L145] COND TRUE \read(systemActive) [L147] CALL processEnvironment() [L167] int tmp ; [L170] COND TRUE ! pumpRunning [L172] CALL, EXPR isHighWaterLevel() [L282] int retValue_acc ; [L283] int tmp ; [L284] int tmp___0 ; [L288] CALL, EXPR isHighWaterSensorDry() [L505] int retValue_acc ; [L508] COND TRUE waterLevel < 2 [L509] retValue_acc = 1 [L510] return (retValue_acc); [L288] RET, EXPR isHighWaterSensorDry() [L288] tmp = isHighWaterSensorDry() [L290] COND TRUE \read(tmp) [L291] tmp___0 = 0 [L295] retValue_acc = tmp___0 [L296] return (retValue_acc); [L172] RET, EXPR isHighWaterLevel() [L172] tmp = isHighWaterLevel() [L174] COND FALSE !(\read(tmp)) [L180] FCALL processEnvironment__wrappee__base() [L147] RET processEnvironment() [L153] CALL __utac_acc__Specification4_spec__1() [L921] int tmp ; [L922] int tmp___0 ; [L926] CALL, EXPR getWaterLevel() [L496] int retValue_acc ; [L499] retValue_acc = waterLevel [L500] return (retValue_acc); [L926] RET, EXPR getWaterLevel() [L926] tmp = getWaterLevel() [L928] COND FALSE !(tmp == 0) [L153] RET __utac_acc__Specification4_spec__1() [L110] RET timeShift() End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 65]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L130] int pumpRunning = 0; [L131] int systemActive = 1; [L325] int cleanupTimeShifts = 4; [L425] int waterLevel = 1; [L426] int methaneLevelCritical = 0; [L723] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L401] int retValue_acc ; [L402] int tmp ; [L406] FCALL select_helpers() [L407] FCALL select_features() [L408] CALL, EXPR valid_product() [L545] int retValue_acc ; [L548] retValue_acc = 1 [L549] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L408] RET, EXPR valid_product() [L408] tmp = valid_product() [L410] COND TRUE \read(tmp) [L412] FCALL setup() [L413] CALL runTest() [L392] CALL test() [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] Loop: [L65] COND TRUE 1 [L67] COND TRUE splverifierCounter < 4 [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L110] CALL timeShift() [L138] COND FALSE !(\read(pumpRunning)) [L145] COND TRUE \read(systemActive) [L147] CALL processEnvironment() [L167] int tmp ; [L170] COND TRUE ! pumpRunning [L172] CALL, EXPR isHighWaterLevel() [L282] int retValue_acc ; [L283] int tmp ; [L284] int tmp___0 ; [L288] CALL, EXPR isHighWaterSensorDry() [L505] int retValue_acc ; [L508] COND TRUE waterLevel < 2 [L509] retValue_acc = 1 [L510] return (retValue_acc); [L288] RET, EXPR isHighWaterSensorDry() [L288] tmp = isHighWaterSensorDry() [L290] COND TRUE \read(tmp) [L291] tmp___0 = 0 [L295] retValue_acc = tmp___0 [L296] return (retValue_acc); [L172] RET, EXPR isHighWaterLevel() [L172] tmp = isHighWaterLevel() [L174] COND FALSE !(\read(tmp)) [L180] FCALL processEnvironment__wrappee__base() [L147] RET processEnvironment() [L153] CALL __utac_acc__Specification4_spec__1() [L921] int tmp ; [L922] int tmp___0 ; [L926] CALL, EXPR getWaterLevel() [L496] int retValue_acc ; [L499] retValue_acc = waterLevel [L500] return (retValue_acc); [L926] RET, EXPR getWaterLevel() [L926] tmp = getWaterLevel() [L928] COND FALSE !(tmp == 0) [L153] RET __utac_acc__Specification4_spec__1() [L110] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 16:16:51,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)