./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product47.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product47.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 637e567dc685efcee308b97525909830094648d3754bb07704f538b9a7ab34e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:52:40,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:52:40,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:52:40,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:52:40,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:52:40,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:52:40,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:52:40,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:52:40,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:52:40,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:52:40,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:52:40,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:52:40,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:52:40,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:52:40,221 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:52:40,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:52:40,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:52:40,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:40,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:52:40,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:52:40,224 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 637e567dc685efcee308b97525909830094648d3754bb07704f538b9a7ab34e7 [2025-02-05 15:52:40,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:52:40,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:52:40,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:52:40,443 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:52:40,443 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:52:40,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product47.cil.c [2025-02-05 15:52:41,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82d97d413/e7226e9ee0a744039895a986722141ef/FLAGe8fdb28b0 [2025-02-05 15:52:41,787 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:52:41,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product47.cil.c [2025-02-05 15:52:41,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82d97d413/e7226e9ee0a744039895a986722141ef/FLAGe8fdb28b0 [2025-02-05 15:52:41,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/82d97d413/e7226e9ee0a744039895a986722141ef [2025-02-05 15:52:41,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:52:41,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:52:41,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:41,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:52:41,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:52:41,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:41" (1/1) ... [2025-02-05 15:52:41,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d36fc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:41, skipping insertion in model container [2025-02-05 15:52:41,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:41" (1/1) ... [2025-02-05 15:52:41,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:52:41,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product47.cil.c[1605,1618] [2025-02-05 15:52:42,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:42,055 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:52:42,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [58] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [162] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [197] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [563] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [631] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [849] [2025-02-05 15:52:42,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [944] [2025-02-05 15:52:42,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product47.cil.c[1605,1618] [2025-02-05 15:52:42,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:42,114 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:52:42,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42 WrapperNode [2025-02-05 15:52:42,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:42,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:42,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:52:42,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:52:42,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,138 INFO L138 Inliner]: procedures = 55, calls = 102, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 197 [2025-02-05 15:52:42,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:42,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:52:42,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:52:42,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:52:42,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,162 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-02-05 15:52:42,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,166 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:52:42,169 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:52:42,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:52:42,169 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:52:42,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (1/1) ... [2025-02-05 15:52:42,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:42,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:52:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:52:42,212 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:52:42,212 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:52:42,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:52:42,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:52:42,275 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:52:42,276 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:52:42,311 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L895: #res := ~retValue_acc~9; [2025-02-05 15:52:42,363 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L927-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; [2025-02-05 15:52:42,363 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L776-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2025-02-05 15:52:42,382 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:52:42,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L194-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-02-05 15:52:42,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L159-1: main_#res#1 := main_~retValue_acc~0#1; [2025-02-05 15:52:42,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L831-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; [2025-02-05 15:52:42,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L941-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; [2025-02-05 15:52:42,471 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L767: #res := ~retValue_acc~6; [2025-02-05 15:52:42,481 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-05 15:52:42,481 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:52:42,491 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:52:42,492 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:52:42,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:42 BoogieIcfgContainer [2025-02-05 15:52:42,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:52:42,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:52:42,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:52:42,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:52:42,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:52:41" (1/3) ... [2025-02-05 15:52:42,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e54317f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:42, skipping insertion in model container [2025-02-05 15:52:42,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:42" (2/3) ... [2025-02-05 15:52:42,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e54317f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:42, skipping insertion in model container [2025-02-05 15:52:42,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:42" (3/3) ... [2025-02-05 15:52:42,499 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product47.cil.c [2025-02-05 15:52:42,508 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:52:42,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product47.cil.c that has 10 procedures, 101 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:52:42,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:52:42,549 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d7ee79d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:52:42,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:52:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 73 states have (on average 1.356164383561644) internal successors, (99), 82 states have internal predecessors, (99), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:52:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:52:42,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:42,557 INFO L218 NwaCegarLoop]: trace 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, 1] [2025-02-05 15:52:42,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:42,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 768842658, now seen corresponding path program 1 times [2025-02-05 15:52:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:42,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023927143] [2025-02-05 15:52:42,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:42,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:42,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:52:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:52:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023927143] [2025-02-05 15:52:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023927143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:42,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:52:42,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820122208] [2025-02-05 15:52:42,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:42,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:52:42,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:42,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:52:42,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:52:42,713 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.356164383561644) internal successors, (99), 82 states have internal predecessors, (99), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:42,740 INFO L93 Difference]: Finished difference Result 184 states and 247 transitions. [2025-02-05 15:52:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:52:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-05 15:52:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:42,747 INFO L225 Difference]: With dead ends: 184 [2025-02-05 15:52:42,748 INFO L226 Difference]: Without dead ends: 92 [2025-02-05 15:52:42,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:52:42,755 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:42,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-05 15:52:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-05 15:52:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 75 states have internal predecessors, (88), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:52:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2025-02-05 15:52:42,797 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 25 [2025-02-05 15:52:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:42,797 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2025-02-05 15:52:42,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2025-02-05 15:52:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:52:42,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:42,800 INFO L218 NwaCegarLoop]: trace 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, 1, 1] [2025-02-05 15:52:42,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:52:42,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:42,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash 973832343, now seen corresponding path program 1 times [2025-02-05 15:52:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:42,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276088557] [2025-02-05 15:52:42,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:42,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:52:42,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:52:42,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:42,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:42,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276088557] [2025-02-05 15:52:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276088557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:42,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066655629] [2025-02-05 15:52:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:42,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:42,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:42,901 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:42,912 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2025-02-05 15:52:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:42,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-05 15:52:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:42,914 INFO L225 Difference]: With dead ends: 147 [2025-02-05 15:52:42,914 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 15:52:42,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:42,915 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 15 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:42,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 15:52:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-05 15:52:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 69 states have internal predecessors, (81), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:52:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 107 transitions. [2025-02-05 15:52:42,922 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 107 transitions. Word has length 26 [2025-02-05 15:52:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:42,922 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 107 transitions. [2025-02-05 15:52:42,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 107 transitions. [2025-02-05 15:52:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:52:42,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:42,923 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1] [2025-02-05 15:52:42,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:52:42,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:42,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash -831759579, now seen corresponding path program 1 times [2025-02-05 15:52:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718507879] [2025-02-05 15:52:42,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:42,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:52:42,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:52:42,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:42,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:43,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718507879] [2025-02-05 15:52:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718507879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:43,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:52:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430668330] [2025-02-05 15:52:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:43,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:52:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:43,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:52:43,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:52:43,053 INFO L87 Difference]: Start difference. First operand 83 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:43,233 INFO L93 Difference]: Finished difference Result 277 states and 364 transitions. [2025-02-05 15:52:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:52:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-05 15:52:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:43,235 INFO L225 Difference]: With dead ends: 277 [2025-02-05 15:52:43,235 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:52:43,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:52:43,236 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 188 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:43,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 475 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:52:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2025-02-05 15:52:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 142 states have (on average 1.3591549295774648) internal successors, (193), 160 states have internal predecessors, (193), 31 states have call successors, (31), 21 states have call predecessors, (31), 21 states have return successors, (32), 23 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 15:52:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 256 transitions. [2025-02-05 15:52:43,253 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 256 transitions. Word has length 29 [2025-02-05 15:52:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:43,253 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 256 transitions. [2025-02-05 15:52:43,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 256 transitions. [2025-02-05 15:52:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:52:43,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:43,255 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:43,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:52:43,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1652022103, now seen corresponding path program 1 times [2025-02-05 15:52:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89208908] [2025-02-05 15:52:43,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:43,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:52:43,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:52:43,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:43,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:43,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89208908] [2025-02-05 15:52:43,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89208908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:43,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:43,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812139268] [2025-02-05 15:52:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:43,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:43,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:43,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:43,381 INFO L87 Difference]: Start difference. First operand 195 states and 256 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:43,448 INFO L93 Difference]: Finished difference Result 554 states and 753 transitions. [2025-02-05 15:52:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:43,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-02-05 15:52:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:43,452 INFO L225 Difference]: With dead ends: 554 [2025-02-05 15:52:43,452 INFO L226 Difference]: Without dead ends: 366 [2025-02-05 15:52:43,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:52:43,455 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 70 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:43,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 393 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-05 15:52:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-02-05 15:52:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 264 states have (on average 1.3333333333333333) internal successors, (352), 296 states have internal predecessors, (352), 62 states have call successors, (62), 42 states have call predecessors, (62), 39 states have return successors, (68), 43 states have call predecessors, (68), 62 states have call successors, (68) [2025-02-05 15:52:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 482 transitions. [2025-02-05 15:52:43,493 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 482 transitions. Word has length 33 [2025-02-05 15:52:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:43,494 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 482 transitions. [2025-02-05 15:52:43,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2025-02-05 15:52:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 15:52:43,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:43,497 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:52:43,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1015021652, now seen corresponding path program 1 times [2025-02-05 15:52:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709607167] [2025-02-05 15:52:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:43,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 15:52:43,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 15:52:43,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:52:43,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:43,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709607167] [2025-02-05 15:52:43,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709607167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:43,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:43,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:43,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839048045] [2025-02-05 15:52:43,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:43,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:43,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:43,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:43,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:43,533 INFO L87 Difference]: Start difference. First operand 366 states and 482 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:43,581 INFO L93 Difference]: Finished difference Result 866 states and 1161 transitions. [2025-02-05 15:52:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:43,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-02-05 15:52:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:43,585 INFO L225 Difference]: With dead ends: 866 [2025-02-05 15:52:43,585 INFO L226 Difference]: Without dead ends: 507 [2025-02-05 15:52:43,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:43,586 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:43,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 170 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-05 15:52:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2025-02-05 15:52:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 368 states have (on average 1.2880434782608696) internal successors, (474), 395 states have internal predecessors, (474), 69 states have call successors, (69), 61 states have call predecessors, (69), 58 states have return successors, (91), 63 states have call predecessors, (91), 69 states have call successors, (91) [2025-02-05 15:52:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 634 transitions. [2025-02-05 15:52:43,631 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 634 transitions. Word has length 35 [2025-02-05 15:52:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:43,632 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 634 transitions. [2025-02-05 15:52:43,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 634 transitions. [2025-02-05 15:52:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:52:43,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:43,633 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:43,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:52:43,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 587154795, now seen corresponding path program 1 times [2025-02-05 15:52:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:43,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089625040] [2025-02-05 15:52:43,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:43,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:52:43,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:52:43,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:43,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:52:43,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:52:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:52:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:52:43,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:43,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:52:43,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:52:43,707 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:52:43,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:52:43,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:52:43,711 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 15:52:43,744 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:52:43,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:52:43 BoogieIcfgContainer [2025-02-05 15:52:43,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:52:43,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:52:43,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:52:43,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:52:43,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:42" (3/4) ... [2025-02-05 15:52:43,750 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:52:43,801 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-02-05 15:52:43,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:52:43,859 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:52:43,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:52:43,860 INFO L158 Benchmark]: Toolchain (without parser) took 2041.15ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 118.9MB in the end (delta: 10.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,860 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 127.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:43,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.48ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 110.4MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.49ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:43,860 INFO L158 Benchmark]: Boogie Preprocessor took 29.34ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,861 INFO L158 Benchmark]: IcfgBuilder took 323.49ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 88.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,861 INFO L158 Benchmark]: TraceAbstraction took 1253.75ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 126.1MB in the end (delta: -38.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:52:43,861 INFO L158 Benchmark]: Witness Printer took 110.36ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 118.9MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:52:43,863 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.21ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 127.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.48ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 110.4MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.49ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 108.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.34ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 323.49ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 88.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1253.75ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 126.1MB in the end (delta: -38.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 110.36ms. Allocated memory is still 167.8MB. Free memory was 126.1MB in the beginning and 118.9MB in the end (delta: 7.2MB). 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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [58] - GenericResultAtLocation [Line: 162]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [162] - GenericResultAtLocation [Line: 197]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [197] - GenericResultAtLocation [Line: 563]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [563] - GenericResultAtLocation [Line: 631]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [631] - GenericResultAtLocation [Line: 849]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [849] - GenericResultAtLocation [Line: 944]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [944] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 54]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L59] int cleanupTimeShifts = 4; [L367] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L639] int pumpRunning = 0; [L640] int systemActive = 1; [L851] int waterLevel = 1; [L852] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L140] int retValue_acc ; [L141] int tmp ; [L145] FCALL select_helpers() [L146] FCALL select_features() [L147] CALL, EXPR valid_product() [L189] int retValue_acc ; [L192] retValue_acc = 1 [L193] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L147] RET, EXPR valid_product() [L147] tmp = valid_product() [L149] COND TRUE \read(tmp) [L151] FCALL setup() [L152] CALL runTest() [L131] CALL test() [L566] int splverifierCounter ; [L567] int tmp ; [L568] int tmp___0 ; [L569] int tmp___1 ; [L570] int tmp___2 ; [L573] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L575] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L577] COND TRUE splverifierCounter < 4 [L583] tmp = __VERIFIER_nondet_int() [L585] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L587] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L869] COND TRUE waterLevel < 2 [L870] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L587] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L593] tmp___0 = __VERIFIER_nondet_int() [L595] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L603] tmp___2 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp___2)) [L609] tmp___1 = __VERIFIER_nondet_int() [L611] COND TRUE \read(tmp___1) [L613] CALL stopSystem() [L838] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L845] systemActive = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L613] RET stopSystem() [L620] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L647] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L654] COND FALSE !(\read(systemActive)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L662] CALL __utac_acc__Specification3_spec__1() [L946] int tmp ; [L947] int tmp___0 ; [L948] int tmp___1 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L952] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L890] int retValue_acc ; [L893] retValue_acc = methaneLevelCritical [L894] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L952] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L952] tmp = isMethaneLevelCritical() [L954] COND FALSE !(\read(tmp)) [L958] CALL, EXPR getWaterLevel() [L922] int retValue_acc ; [L925] retValue_acc = waterLevel [L926] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L958] RET, EXPR getWaterLevel() [L958] tmp___0 = getWaterLevel() [L960] COND TRUE tmp___0 == 2 [L962] CALL, EXPR isPumpRunning() [L771] int retValue_acc ; [L774] retValue_acc = pumpRunning [L775] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L962] RET, EXPR isPumpRunning() [L962] tmp___1 = isPumpRunning() [L964] COND FALSE !(\read(tmp___1)) [L968] CALL __automaton_fail() [L54] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 1354 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 799 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 555 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:52:43,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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