./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product07.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product07.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a64b003b731919e31189fa64bb054d2c00bb1b0f73ef780cb3fb445d82092416 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:39:56,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:39:56,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:39:56,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:39:56,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:39:56,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:39:56,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:39:56,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:39:56,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:39:56,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:39:56,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:39:56,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:39:56,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:39:56,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:39:56,779 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:39:56,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:39:56,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:39:56,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:39:56,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:39:56,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:39:56,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:39:56,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:39:56,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:56,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:39:56,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:39:56,782 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/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 -> a64b003b731919e31189fa64bb054d2c00bb1b0f73ef780cb3fb445d82092416 [2025-03-08 05:39:57,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:39:57,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:39:57,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:39:57,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:39:57,026 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:39:57,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product07.cil.c [2025-03-08 05:39:58,213 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45e85077/7c948bacbaa64f0a8c14ccf9e2ffb75b/FLAGd0c83b400 [2025-03-08 05:39:58,440 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:39:58,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product07.cil.c [2025-03-08 05:39:58,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45e85077/7c948bacbaa64f0a8c14ccf9e2ffb75b/FLAGd0c83b400 [2025-03-08 05:39:58,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45e85077/7c948bacbaa64f0a8c14ccf9e2ffb75b [2025-03-08 05:39:58,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:39:58,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:39:58,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:58,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:39:58,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:39:58,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:58" (1/1) ... [2025-03-08 05:39:58,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc13a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:58, skipping insertion in model container [2025-03-08 05:39:58,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:39:58" (1/1) ... [2025-03-08 05:39:58,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:39:58,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product07.cil.c[1605,1618] [2025-03-08 05:39:58,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:59,004 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:39:59,010 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [58] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [96] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [197] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [563] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [600] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [753] [2025-03-08 05:39:59,011 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [820] [2025-03-08 05:39:59,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product07.cil.c[1605,1618] [2025-03-08 05:39:59,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:39:59,065 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:39:59,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59 WrapperNode [2025-03-08 05:39:59,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:39:59,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:59,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:39:59,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:39:59,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,098 INFO L138 Inliner]: procedures = 51, calls = 95, calls flagged for inlining = 19, calls inlined = 16, statements flattened = 160 [2025-03-08 05:39:59,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:39:59,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:39:59,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:39:59,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:39:59,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,124 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-08 05:39:59,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:39:59,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:39:59,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:39:59,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:39:59,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (1/1) ... [2025-03-08 05:39:59,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:39:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:39:59,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:39:59,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:39:59,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:39:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:39:59,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:39:59,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:39:59,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:39:59,259 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: #res := ~retValue_acc~8; [2025-03-08 05:39:59,311 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L690-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~6#1; [2025-03-08 05:39:59,311 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L897-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~9#1; [2025-03-08 05:39:59,311 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L699-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2025-03-08 05:39:59,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L194-1: main_#res#1 := main_~retValue_acc~2#1; [2025-03-08 05:39:59,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L93-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:39:59,437 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-08 05:39:59,438 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:39:59,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:39:59,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:39:59,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:59 BoogieIcfgContainer [2025-03-08 05:39:59,452 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:39:59,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:39:59,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:39:59,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:39:59,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:39:58" (1/3) ... [2025-03-08 05:39:59,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515b6300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:59, skipping insertion in model container [2025-03-08 05:39:59,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:39:59" (2/3) ... [2025-03-08 05:39:59,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515b6300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:39:59, skipping insertion in model container [2025-03-08 05:39:59,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:59" (3/3) ... [2025-03-08 05:39:59,459 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product07.cil.c [2025-03-08 05:39:59,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:39:59,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product07.cil.c that has 8 procedures, 78 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:39:59,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:39:59,523 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;@e4214db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:39:59,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:39:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.368421052631579) internal successors, (78), 64 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 05:39:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:39:59,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:59,535 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-03-08 05:39:59,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:59,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1460073377, now seen corresponding path program 1 times [2025-03-08 05:39:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704044930] [2025-03-08 05:39:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:59,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:39:59,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:39:59,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:59,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:59,749 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-08 05:39:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704044930] [2025-03-08 05:39:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704044930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:59,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213899721] [2025-03-08 05:39:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:39:59,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:39:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:39:59,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:39:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:39:59,774 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.368421052631579) internal successors, (78), 64 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-08 05:39:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:39:59,810 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2025-03-08 05:39:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:39:59,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-08 05:39:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:39:59,819 INFO L225 Difference]: With dead ends: 136 [2025-03-08 05:39:59,819 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 05:39:59,823 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-03-08 05:39:59,826 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 143 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-03-08 05:39:59,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:39:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 05:39:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 05:39:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 51 states have internal predecessors, (60), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 05:39:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2025-03-08 05:39:59,864 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 25 [2025-03-08 05:39:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:39:59,865 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-03-08 05:39:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-03-08 05:39:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2025-03-08 05:39:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:39:59,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:39:59,867 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] [2025-03-08 05:39:59,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:39:59,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:39:59,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:39:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 113169172, now seen corresponding path program 1 times [2025-03-08 05:39:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:39:59,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237826600] [2025-03-08 05:39:59,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:39:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:39:59,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:39:59,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:39:59,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:39:59,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:39:59,998 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-08 05:39:59,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:39:59,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237826600] [2025-03-08 05:39:59,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237826600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:39:59,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:39:59,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:39:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836546454] [2025-03-08 05:39:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:00,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:40:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:00,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:40:00,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:40:00,001 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03-08 05:40:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:00,028 INFO L93 Difference]: Finished difference Result 168 states and 220 transitions. [2025-03-08 05:40:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:40:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2025-03-08 05:40:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:00,033 INFO L225 Difference]: With dead ends: 168 [2025-03-08 05:40:00,034 INFO L226 Difference]: Without dead ends: 114 [2025-03-08 05:40:00,034 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-03-08 05:40:00,035 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:00,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-08 05:40:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2025-03-08 05:40:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.3625) internal successors, (109), 91 states have internal predecessors, (109), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 05:40:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2025-03-08 05:40:00,053 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 28 [2025-03-08 05:40:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2025-03-08 05:40:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-03-08 05:40:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2025-03-08 05:40:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:40:00,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:00,058 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] [2025-03-08 05:40:00,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:40:00,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:00,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 474375128, now seen corresponding path program 1 times [2025-03-08 05:40:00,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:00,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339827881] [2025-03-08 05:40:00,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:40:00,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:40:00,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:00,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:00,224 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-08 05:40:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339827881] [2025-03-08 05:40:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339827881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:00,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:00,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:40:00,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674440208] [2025-03-08 05:40:00,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:00,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:40:00,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:00,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:40:00,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:40:00,226 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-08 05:40:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:00,299 INFO L93 Difference]: Finished difference Result 307 states and 416 transitions. [2025-03-08 05:40:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:40:00,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2025-03-08 05:40:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:00,305 INFO L225 Difference]: With dead ends: 307 [2025-03-08 05:40:00,305 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 05:40:00,306 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-03-08 05:40:00,306 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:00,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 282 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 05:40:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 05:40:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 163 states have internal predecessors, (194), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (38), 24 states have call predecessors, (38), 36 states have call successors, (38) [2025-03-08 05:40:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 268 transitions. [2025-03-08 05:40:00,347 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 268 transitions. Word has length 32 [2025-03-08 05:40:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:00,348 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 268 transitions. [2025-03-08 05:40:00,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-08 05:40:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 268 transitions. [2025-03-08 05:40:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 05:40:00,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:00,351 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] [2025-03-08 05:40:00,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:40:00,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:00,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1946683291, now seen corresponding path program 1 times [2025-03-08 05:40:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509012187] [2025-03-08 05:40:00,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:00,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:40:00,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:40:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:00,417 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-08 05:40:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509012187] [2025-03-08 05:40:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509012187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:40:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851017998] [2025-03-08 05:40:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:00,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:40:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:00,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:40:00,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:40:00,420 INFO L87 Difference]: Start difference. First operand 203 states and 268 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-03-08 05:40:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:00,450 INFO L93 Difference]: Finished difference Result 353 states and 469 transitions. [2025-03-08 05:40:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:40:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 34 [2025-03-08 05:40:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:00,452 INFO L225 Difference]: With dead ends: 353 [2025-03-08 05:40:00,452 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 05:40:00,454 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-03-08 05:40:00,454 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:00,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 05:40:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-03-08 05:40:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 123 states have internal predecessors, (148), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 05:40:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 188 transitions. [2025-03-08 05:40:00,468 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 188 transitions. Word has length 34 [2025-03-08 05:40:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:00,468 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 188 transitions. [2025-03-08 05:40:00,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-03-08 05:40:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 188 transitions. [2025-03-08 05:40:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 05:40:00,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:00,469 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] [2025-03-08 05:40:00,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:40:00,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:00,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1395943110, now seen corresponding path program 1 times [2025-03-08 05:40:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:00,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008686100] [2025-03-08 05:40:00,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:00,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:40:00,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:40:00,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:00,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:40:00,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:40:00,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:40:00,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:40:00,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:00,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:40:00,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:40:00,514 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:40:00,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:40:00,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:40:00,517 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 05:40:00,540 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:40:00,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:40:00 BoogieIcfgContainer [2025-03-08 05:40:00,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:40:00,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:40:00,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:40:00,543 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:40:00,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:39:59" (3/4) ... [2025-03-08 05:40:00,544 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:40:00,586 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 31. [2025-03-08 05:40:00,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:40:00,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:40:00,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:40:00,641 INFO L158 Benchmark]: Toolchain (without parser) took 1876.90ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 84.3MB in the end (delta: 48.0MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-03-08 05:40:00,642 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:40:00,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.57ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 114.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:40:00,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.73ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 112.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:40:00,642 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:40:00,642 INFO L158 Benchmark]: IcfgBuilder took 319.38ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 93.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:40:00,642 INFO L158 Benchmark]: TraceAbstraction took 1089.20ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 91.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:40:00,644 INFO L158 Benchmark]: Witness Printer took 98.25ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 84.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:40:00,645 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 is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.57ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 114.1MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.73ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 112.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 111.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 319.38ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 93.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1089.20ms. Allocated memory is still 167.8MB. Free memory was 93.4MB in the beginning and 91.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 98.25ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 84.3MB in the end (delta: 7.5MB). 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,"featureselect.i","") [58] - GenericResultAtLocation [Line: 96]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [96] - 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,"Specification3_spec.i","") [563] - GenericResultAtLocation [Line: 600]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [600] - GenericResultAtLocation [Line: 753]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [753] - GenericResultAtLocation [Line: 820]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [820] * 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: [L97] int cleanupTimeShifts = 4; [L367] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L606] int pumpRunning = 0; [L607] int systemActive = 1; [L821] int waterLevel = 1; [L822] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L175] int retValue_acc ; [L176] int tmp ; [L180] FCALL select_helpers() [L181] FCALL select_features() [L182] CALL, EXPR valid_product() [L88] int retValue_acc ; [L91] retValue_acc = 1 [L92] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L182] RET, EXPR valid_product() [L182] tmp = valid_product() [L184] COND TRUE \read(tmp) [L186] FCALL setup() [L187] CALL runTest() [L169] CALL test() [L755] int splverifierCounter ; [L756] int tmp ; [L757] int tmp___0 ; [L758] int tmp___1 ; [L759] int tmp___2 ; [L762] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L766] COND TRUE splverifierCounter < 4 [L772] tmp = __VERIFIER_nondet_int() [L774] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L776] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L839] COND TRUE waterLevel < 2 [L840] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L776] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L782] tmp___0 = __VERIFIER_nondet_int() [L784] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L792] tmp___2 = __VERIFIER_nondet_int() [L794] COND FALSE !(\read(tmp___2)) [L798] tmp___1 = __VERIFIER_nondet_int() [L800] COND TRUE \read(tmp___1) [L802] CALL stopSystem() [L742] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L749] systemActive = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L802] RET stopSystem() [L809] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L613] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L620] COND FALSE !(\read(systemActive)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L628] CALL __utac_acc__Specification3_spec__1() [L568] int tmp ; [L569] int tmp___0 ; [L570] int tmp___1 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L574] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L860] int retValue_acc ; [L863] retValue_acc = methaneLevelCritical [L864] 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] [L574] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L574] tmp = isMethaneLevelCritical() [L576] COND FALSE !(\read(tmp)) [L580] CALL, EXPR getWaterLevel() [L892] int retValue_acc ; [L895] retValue_acc = waterLevel [L896] 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] [L580] RET, EXPR getWaterLevel() [L580] tmp___0 = getWaterLevel() [L582] COND TRUE tmp___0 == 2 [L584] CALL, EXPR isPumpRunning() [L694] int retValue_acc ; [L697] retValue_acc = pumpRunning [L698] 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] [L584] RET, EXPR isPumpRunning() [L584] tmp___1 = isPumpRunning() [L586] COND FALSE !(\read(tmp___1)) [L590] 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 8 procedures, 78 locations, 114 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 641 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 339 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 302 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-03-08 05:40:00,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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