./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product24.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 168393e8d033cc8a1f93b6836944286e12246452392b8a342ff0210c89948e1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:30:07,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:30:07,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:30:07,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:30:07,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:30:07,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:30:07,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:30:07,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:30:07,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:30:07,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:30:07,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:30:07,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:30:07,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:30:07,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:30:07,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:30:07,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:30:07,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:30:07,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:30:07,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:30:07,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:30:07,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:30:07,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:30:07,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:30:07,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:30:07,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:30:07,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:30:07,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:30:07,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:30:07,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:30:07,492 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 -> 168393e8d033cc8a1f93b6836944286e12246452392b8a342ff0210c89948e1e [2025-03-03 14:30:07,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:30:07,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:30:07,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:30:07,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:30:07,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:30:07,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product24.cil.c [2025-03-03 14:30:08,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ceb3b724/98db40a58fb84abcba2d287a4e5f1756/FLAGb21ac6382 [2025-03-03 14:30:09,053 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:30:09,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product24.cil.c [2025-03-03 14:30:09,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ceb3b724/98db40a58fb84abcba2d287a4e5f1756/FLAGb21ac6382 [2025-03-03 14:30:09,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ceb3b724/98db40a58fb84abcba2d287a4e5f1756 [2025-03-03 14:30:09,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:30:09,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:30:09,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:30:09,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:30:09,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:30:09,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2edc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09, skipping insertion in model container [2025-03-03 14:30:09,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:30:09,263 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_product24.cil.c[1605,1618] [2025-03-03 14:30:09,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:30:09,375 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:30:09,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2025-03-03 14:30:09,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] [2025-03-03 14:30:09,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [271] [2025-03-03 14:30:09,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [343] [2025-03-03 14:30:09,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [378] [2025-03-03 14:30:09,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [477] [2025-03-03 14:30:09,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [843] [2025-03-03 14:30:09,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [932] [2025-03-03 14:30:09,386 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_product24.cil.c[1605,1618] [2025-03-03 14:30:09,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:30:09,458 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:30:09,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09 WrapperNode [2025-03-03 14:30:09,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:30:09,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:30:09,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:30:09,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:30:09,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,489 INFO L138 Inliner]: procedures = 55, calls = 101, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 195 [2025-03-03 14:30:09,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:30:09,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:30:09,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:30:09,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:30:09,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,514 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-03 14:30:09,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:30:09,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:30:09,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:30:09,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:30:09,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (1/1) ... [2025-03-03 14:30:09,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:30:09,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:30:09,555 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-03 14:30:09,561 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-03 14:30:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:30:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-03 14:30:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-03 14:30:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:30:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-03 14:30:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-03 14:30:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:30:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:30:09,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:30:09,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:30:09,687 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L888: #res := ~retValue_acc~7; [2025-03-03 14:30:09,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L190-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-03-03 14:30:09,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L920-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~8#1; [2025-03-03 14:30:09,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L181-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~0#1; [2025-03-03 14:30:09,797 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L474-1: main_#res#1 := main_~retValue_acc~3#1; [2025-03-03 14:30:09,798 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L964-1: valid_product_#res#1 := valid_product_~retValue_acc~11#1; [2025-03-03 14:30:09,819 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L929-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~9#1; [2025-03-03 14:30:09,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L245-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~2#1; [2025-03-03 14:30:09,833 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-03 14:30:09,833 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:30:09,841 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:30:09,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:30:09,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:30:09 BoogieIcfgContainer [2025-03-03 14:30:09,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:30:09,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:30:09,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:30:09,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:30:09,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:30:09" (1/3) ... [2025-03-03 14:30:09,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8479c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:30:09, skipping insertion in model container [2025-03-03 14:30:09,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:30:09" (2/3) ... [2025-03-03 14:30:09,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8479c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:30:09, skipping insertion in model container [2025-03-03 14:30:09,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:30:09" (3/3) ... [2025-03-03 14:30:09,850 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product24.cil.c [2025-03-03 14:30:09,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:30:09,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product24.cil.c that has 9 procedures, 93 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:30:09,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:30:09,915 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;@5dcffedc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:30:09,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:30:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 77 states have internal predecessors, (92), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 11 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 14:30:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:30:09,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:30:09,927 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-03 14:30:09,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:30:09,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:30:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1715791084, now seen corresponding path program 1 times [2025-03-03 14:30:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:30:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068424659] [2025-03-03 14:30:09,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:30:09,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:30:10,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:30:10,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:30:10,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:30:10,100 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-03 14:30:10,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:30:10,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068424659] [2025-03-03 14:30:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068424659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:30:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:30:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:30:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122337704] [2025-03-03 14:30:10,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:30:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:30:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:30:10,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:30:10,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:30:10,124 INFO L87 Difference]: Start difference. First operand has 93 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 77 states have internal predecessors, (92), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 11 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-03-03 14:30:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:30:10,149 INFO L93 Difference]: Finished difference Result 178 states and 239 transitions. [2025-03-03 14:30:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:30:10,150 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-03-03 14:30:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:30:10,158 INFO L225 Difference]: With dead ends: 178 [2025-03-03 14:30:10,158 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 14:30:10,162 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-03-03 14:30:10,164 INFO L435 NwaCegarLoop]: 118 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, 118 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-03-03 14:30:10,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:30:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 14:30:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-03 14:30:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 69 states have internal predecessors, (80), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 10 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 14:30:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2025-03-03 14:30:10,203 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 25 [2025-03-03 14:30:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:30:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2025-03-03 14:30:10,204 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-03-03 14:30:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2025-03-03 14:30:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 14:30:10,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:30:10,205 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-03-03 14:30:10,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:30:10,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:30:10,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:30:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1324682557, now seen corresponding path program 1 times [2025-03-03 14:30:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:30:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494549940] [2025-03-03 14:30:10,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:30:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:30:10,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:30:10,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:30:10,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:30:10,303 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-03 14:30:10,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:30:10,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494549940] [2025-03-03 14:30:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494549940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:30:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:30:10,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:30:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611749789] [2025-03-03 14:30:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:30:10,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:30:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:30:10,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:30:10,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:30:10,305 INFO L87 Difference]: Start difference. First operand 84 states and 109 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-03-03 14:30:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:30:10,330 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2025-03-03 14:30:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:30:10,330 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-03-03 14:30:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:30:10,331 INFO L225 Difference]: With dead ends: 130 [2025-03-03 14:30:10,331 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 14:30:10,331 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-03 14:30:10,332 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 171 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-03 14:30:10,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:30:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 14:30:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 14:30:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 63 states have internal predecessors, (73), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 14:30:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2025-03-03 14:30:10,337 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 26 [2025-03-03 14:30:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:30:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2025-03-03 14:30:10,337 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-03-03 14:30:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2025-03-03 14:30:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 14:30:10,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:30:10,338 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] [2025-03-03 14:30:10,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:30:10,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:30:10,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:30:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash 592397578, now seen corresponding path program 1 times [2025-03-03 14:30:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:30:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318484529] [2025-03-03 14:30:10,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:30:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:30:10,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 14:30:10,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 14:30:10,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:30:10,385 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-03 14:30:10,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:30:10,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318484529] [2025-03-03 14:30:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318484529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:30:10,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:30:10,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:30:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513330239] [2025-03-03 14:30:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:30:10,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:30:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:30:10,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:30:10,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:30:10,386 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03 14:30:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:30:10,407 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2025-03-03 14:30:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:30:10,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2025-03-03 14:30:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:30:10,409 INFO L225 Difference]: With dead ends: 209 [2025-03-03 14:30:10,409 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 14:30:10,409 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-03 14:30:10,410 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 89 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:30:10,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 198 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:30:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 14:30:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2025-03-03 14:30:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 114 states have internal predecessors, (134), 24 states have call successors, (24), 14 states have call predecessors, (24), 14 states have return successors, (24), 15 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 14:30:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2025-03-03 14:30:10,425 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 30 [2025-03-03 14:30:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:30:10,425 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2025-03-03 14:30:10,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03 14:30:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2025-03-03 14:30:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 14:30:10,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:30:10,426 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-03-03 14:30:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:30:10,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:30:10,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:30:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1764045087, now seen corresponding path program 1 times [2025-03-03 14:30:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:30:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637222089] [2025-03-03 14:30:10,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:30:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:30:10,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:30:10,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:30:10,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:30:10,547 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-03 14:30:10,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:30:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637222089] [2025-03-03 14:30:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637222089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:30:10,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:30:10,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:30:10,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174244627] [2025-03-03 14:30:10,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:30:10,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:30:10,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:30:10,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:30:10,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:30:10,548 INFO L87 Difference]: Start difference. First operand 138 states and 182 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-03-03 14:30:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:30:10,615 INFO L93 Difference]: Finished difference Result 388 states and 527 transitions. [2025-03-03 14:30:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:30:10,616 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-03-03 14:30:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:30:10,618 INFO L225 Difference]: With dead ends: 388 [2025-03-03 14:30:10,618 INFO L226 Difference]: Without dead ends: 257 [2025-03-03 14:30:10,619 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-03 14:30:10,619 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 61 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:30:10,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 354 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:30:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-03 14:30:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-03 14:30:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.3406593406593406) internal successors, (244), 209 states have internal predecessors, (244), 48 states have call successors, (48), 28 states have call predecessors, (48), 26 states have return successors, (50), 28 states have call predecessors, (50), 48 states have call successors, (50) [2025-03-03 14:30:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 342 transitions. [2025-03-03 14:30:10,648 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 342 transitions. Word has length 33 [2025-03-03 14:30:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:30:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 342 transitions. [2025-03-03 14:30:10,648 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-03-03 14:30:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2025-03-03 14:30:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-03 14:30:10,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:30:10,650 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-03-03 14:30:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:30:10,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:30:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:30:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1543561054, now seen corresponding path program 1 times [2025-03-03 14:30:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:30:10,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105259346] [2025-03-03 14:30:10,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:30:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:30:10,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-03 14:30:10,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-03 14:30:10,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:30:10,703 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-03 14:30:10,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:30:10,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105259346] [2025-03-03 14:30:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105259346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:30:10,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:30:10,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:30:10,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675845695] [2025-03-03 14:30:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:30:10,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:30:10,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:30:10,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:30:10,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:30:10,704 INFO L87 Difference]: Start difference. First operand 257 states and 342 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-03-03 14:30:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:30:10,729 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2025-03-03 14:30:10,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:30:10,730 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-03-03 14:30:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:30:10,734 INFO L225 Difference]: With dead ends: 433 [2025-03-03 14:30:10,734 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 14:30:10,735 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-03 14:30:10,736 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:30:10,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:30:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 14:30:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-03-03 14:30:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 141 states have internal predecessors, (166), 24 states have call successors, (24), 24 states have call predecessors, (24), 22 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 14:30:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 214 transitions. [2025-03-03 14:30:10,761 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 214 transitions. Word has length 35 [2025-03-03 14:30:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:30:10,761 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 214 transitions. [2025-03-03 14:30:10,761 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-03-03 14:30:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 214 transitions. [2025-03-03 14:30:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:30:10,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:30:10,762 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-03-03 14:30:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:30:10,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:30:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:30:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -704489983, now seen corresponding path program 1 times [2025-03-03 14:30:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:30:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718690643] [2025-03-03 14:30:10,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:30:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:30:10,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:30:10,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:30:10,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:30:10,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:30:10,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:30:10,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:30:10,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:30:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:30:10,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:30:10,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:30:10,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:30:10,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:30:10,829 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 14:30:10,854 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:30:10,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:30:10 BoogieIcfgContainer [2025-03-03 14:30:10,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:30:10,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:30:10,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:30:10,856 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:30:10,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:30:09" (3/4) ... [2025-03-03 14:30:10,857 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:30:10,897 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-03-03 14:30:10,946 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:30:10,947 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:30:10,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:30:10,947 INFO L158 Benchmark]: Toolchain (without parser) took 1855.93ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 97.3MB in the end (delta: 6.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-03-03 14:30:10,947 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:30:10,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.79ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 85.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:30:10,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.23ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 84.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:30:10,948 INFO L158 Benchmark]: Boogie Preprocessor took 37.27ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:30:10,948 INFO L158 Benchmark]: IcfgBuilder took 312.52ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 64.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:30:10,948 INFO L158 Benchmark]: TraceAbstraction took 1012.34ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 104.8MB in the end (delta: -41.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2025-03-03 14:30:10,949 INFO L158 Benchmark]: Witness Printer took 90.56ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 97.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:30:10,950 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.13ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.79ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 85.3MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.23ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 84.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.27ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 312.52ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 64.3MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1012.34ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 104.8MB in the end (delta: -41.5MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Witness Printer took 90.56ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 97.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,"MinePump.i","") [58] - GenericResultAtLocation [Line: 271]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [271] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [343] - GenericResultAtLocation [Line: 378]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [378] - GenericResultAtLocation [Line: 477]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [477] - GenericResultAtLocation [Line: 843]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [843] - GenericResultAtLocation [Line: 932]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [932] * 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: [L70] int pumpRunning = 0; [L71] int systemActive = 1; [L379] int cleanupTimeShifts = 4; [L647] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L844] int waterLevel = 1; [L845] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L455] int retValue_acc ; [L456] int tmp ; [L460] FCALL select_helpers() [L461] FCALL select_features() [L462] CALL, EXPR valid_product() [L959] int retValue_acc ; [L962] retValue_acc = 1 [L963] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L462] RET, EXPR valid_product() [L462] tmp = valid_product() [L464] COND TRUE \read(tmp) [L466] FCALL setup() [L467] CALL runTest() [L446] CALL test() [L276] int splverifierCounter ; [L277] int tmp ; [L278] int tmp___0 ; [L279] int tmp___1 ; [L280] int tmp___2 ; [L283] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L285] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L287] COND TRUE splverifierCounter < 4 [L293] tmp = __VERIFIER_nondet_int() [L295] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L297] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L862] COND TRUE waterLevel < 2 [L863] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L297] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L303] tmp___0 = __VERIFIER_nondet_int() [L305] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L313] tmp___2 = __VERIFIER_nondet_int() [L315] COND FALSE !(\read(tmp___2)) [L321] tmp___1 = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp___1) [L325] CALL stopSystem() [L252] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L259] systemActive = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L325] RET stopSystem() [L332] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L78] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L85] COND FALSE !(\read(systemActive)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L93] CALL __utac_acc__Specification3_spec__1() [L346] int tmp ; [L347] int tmp___0 ; [L348] int tmp___1 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L352] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L883] int retValue_acc ; [L886] retValue_acc = methaneLevelCritical [L887] 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] [L352] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=0, waterLevel=2] [L352] tmp = isMethaneLevelCritical() [L354] COND FALSE !(\read(tmp)) [L358] CALL, EXPR getWaterLevel() [L915] int retValue_acc ; [L918] retValue_acc = waterLevel [L919] 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] [L358] RET, EXPR getWaterLevel() [L358] tmp___0 = getWaterLevel() [L360] COND TRUE tmp___0 == 2 [L362] CALL, EXPR isPumpRunning() [L185] int retValue_acc ; [L188] retValue_acc = pumpRunning [L189] 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] [L362] RET, EXPR isPumpRunning() [L362] tmp___1 = isPumpRunning() [L364] COND FALSE !(\read(tmp___1)) [L368] 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 9 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 901 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 478 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=4, InterpolantAutomatonStates: 16, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 246 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-03-03 14:30:10,967 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