./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product51.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_spec2_product51.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 242c9b24ea8c293cca4af0028144a97f9048375edcd4379fb21e62564563d3d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:29:37,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:29:37,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:29:37,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:29:37,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:29:37,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:29:37,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:29:37,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:29:37,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:29:37,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:29:37,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:29:37,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:29:37,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:29:37,224 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:29:37,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:29:37,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:29:37,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:29:37,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:29:37,226 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 -> 242c9b24ea8c293cca4af0028144a97f9048375edcd4379fb21e62564563d3d5 [2025-03-03 14:29:37,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:29:37,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:29:37,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:29:37,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:29:37,477 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:29:37,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c [2025-03-03 14:29:38,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4905a3f/7f683e428df44fcaa90df91cedfc7c9e/FLAG2130af5b7 [2025-03-03 14:29:38,863 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:29:38,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c [2025-03-03 14:29:38,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4905a3f/7f683e428df44fcaa90df91cedfc7c9e/FLAG2130af5b7 [2025-03-03 14:29:39,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4905a3f/7f683e428df44fcaa90df91cedfc7c9e [2025-03-03 14:29:39,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:29:39,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:29:39,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:29:39,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:29:39,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:29:39,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b657fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39, skipping insertion in model container [2025-03-03 14:29:39,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:29:39,329 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_spec2_product51.cil.c[9329,9342] [2025-03-03 14:29:39,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:29:39,390 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:29:39,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [343] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [383] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [421] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [525] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [622] [2025-03-03 14:29:39,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [631] [2025-03-03 14:29:39,421 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_spec2_product51.cil.c[9329,9342] [2025-03-03 14:29:39,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:29:39,473 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:29:39,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39 WrapperNode [2025-03-03 14:29:39,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:29:39,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:29:39,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:29:39,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:29:39,480 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:29:39" (1/1) ... [2025-03-03 14:29:39,487 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:29:39" (1/1) ... [2025-03-03 14:29:39,501 INFO L138 Inliner]: procedures = 57, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 206 [2025-03-03 14:29:39,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:29:39,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:29:39,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:29:39,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:29:39,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,529 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:29:39,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:29:39,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:29:39,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:29:39,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:29:39,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (1/1) ... [2025-03-03 14:29:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:29:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:39,560 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:29:39,562 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:29:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:29:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-03 14:29:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-03 14:29:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-03 14:29:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-03 14:29:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:29:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:29:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:29:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:29:39,578 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:29:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:29:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-03 14:29:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-03 14:29:39,579 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-03 14:29:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-03 14:29:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:29:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-03 14:29:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-03 14:29:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:29:39,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:29:39,636 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:29:39,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:29:39,672 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: #res := ~retValue_acc~6; [2025-03-03 14:29:39,768 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L325-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2025-03-03 14:29:39,768 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L251-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-03-03 14:29:39,768 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L522-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~9#1; [2025-03-03 14:29:39,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L418-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-03 14:29:39,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L619-1: main_#res#1 := main_~retValue_acc~10#1; [2025-03-03 14:29:39,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L513-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~8#1; [2025-03-03 14:29:39,879 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L306-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-03-03 14:29:39,899 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-03 14:29:39,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:29:39,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:29:39,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:29:39,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:29:39 BoogieIcfgContainer [2025-03-03 14:29:39,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:29:39,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:29:39,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:29:39,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:29:39,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:29:39" (1/3) ... [2025-03-03 14:29:39,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69357c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:29:39, skipping insertion in model container [2025-03-03 14:29:39,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:39" (2/3) ... [2025-03-03 14:29:39,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69357c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:29:39, skipping insertion in model container [2025-03-03 14:29:39,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:29:39" (3/3) ... [2025-03-03 14:29:39,917 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product51.cil.c [2025-03-03 14:29:39,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:29:39,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product51.cil.c that has 9 procedures, 94 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:29:39,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:29:39,977 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;@18844a6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:29:39,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:29:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 80 states have internal predecessors, (97), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:29:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:29:39,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:39,986 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:29:39,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:39,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:39,989 INFO L85 PathProgramCache]: Analyzing trace with hash -134763790, now seen corresponding path program 1 times [2025-03-03 14:29:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706756763] [2025-03-03 14:29:39,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:40,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:29:40,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:29:40,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:40,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:40,114 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:29:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706756763] [2025-03-03 14:29:40,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706756763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:40,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:40,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:29:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33780627] [2025-03-03 14:29:40,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:40,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:29:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:40,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:29:40,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:29:40,137 INFO L87 Difference]: Start difference. First operand has 94 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 80 states have internal predecessors, (97), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) 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:29:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:40,162 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2025-03-03 14:29:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:29:40,163 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:29:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:40,169 INFO L225 Difference]: With dead ends: 179 [2025-03-03 14:29:40,170 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 14:29:40,173 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:29:40,177 INFO L435 NwaCegarLoop]: 119 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, 119 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:29:40,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 14:29:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 14:29:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.328125) internal successors, (85), 72 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 14:29:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2025-03-03 14:29:40,206 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 25 [2025-03-03 14:29:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:40,206 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2025-03-03 14:29:40,206 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:29:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2025-03-03 14:29:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 14:29:40,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:40,208 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:29:40,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:29:40,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:40,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash -474669604, now seen corresponding path program 1 times [2025-03-03 14:29:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:40,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015718351] [2025-03-03 14:29:40,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:40,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:40,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:29:40,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:29:40,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:40,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:40,292 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:29:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:40,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015718351] [2025-03-03 14:29:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015718351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:40,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:29:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929551314] [2025-03-03 14:29:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:40,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:40,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:40,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:40,295 INFO L87 Difference]: Start difference. First operand 85 states and 110 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:29:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:40,319 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2025-03-03 14:29:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:40,321 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:29:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:40,322 INFO L225 Difference]: With dead ends: 132 [2025-03-03 14:29:40,322 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 14:29:40,322 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:29:40,323 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 15 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 174 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:29:40,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 174 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 14:29:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-03 14:29:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 66 states have internal predecessors, (78), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 14:29:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-03-03 14:29:40,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 26 [2025-03-03 14:29:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:40,330 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-03-03 14:29:40,330 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:29:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-03-03 14:29:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 14:29:40,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:40,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:40,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:29:40,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1817421684, now seen corresponding path program 1 times [2025-03-03 14:29:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427249928] [2025-03-03 14:29:40,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:40,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 14:29:40,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 14:29:40,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:40,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:40,429 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:29:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:40,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427249928] [2025-03-03 14:29:40,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427249928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:29:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146524335] [2025-03-03 14:29:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:40,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:40,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:40,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:40,432 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:29:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:40,459 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2025-03-03 14:29:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-03 14:29:40,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:40,461 INFO L225 Difference]: With dead ends: 211 [2025-03-03 14:29:40,461 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 14:29:40,462 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:29:40,462 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 78 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 202 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-03 14:29:40,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 14:29:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2025-03-03 14:29:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 120 states have internal predecessors, (144), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 14:29:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 184 transitions. [2025-03-03 14:29:40,485 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 184 transitions. Word has length 29 [2025-03-03 14:29:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:40,486 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 184 transitions. [2025-03-03 14:29:40,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:29:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2025-03-03 14:29:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 14:29:40,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:40,487 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:29:40,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:29:40,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1525443000, now seen corresponding path program 1 times [2025-03-03 14:29:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-03-03 14:29:40,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:29:40,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:29:40,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:40,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:40,598 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:29:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:40,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-03-03 14:29:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085792694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:40,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:40,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619833899] [2025-03-03 14:29:40,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:40,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:40,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:40,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:40,599 INFO L87 Difference]: Start difference. First operand 140 states and 184 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:29:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:40,679 INFO L93 Difference]: Finished difference Result 352 states and 475 transitions. [2025-03-03 14:29:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:29:40,680 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:29:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:40,681 INFO L225 Difference]: With dead ends: 352 [2025-03-03 14:29:40,681 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 14:29:40,682 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:29:40,683 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:40,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 345 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 14:29:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2025-03-03 14:29:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 164 states have (on average 1.329268292682927) internal successors, (218), 179 states have internal predecessors, (218), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2025-03-03 14:29:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2025-03-03 14:29:40,702 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 33 [2025-03-03 14:29:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2025-03-03 14:29:40,702 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:29:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2025-03-03 14:29:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:29:40,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:40,706 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:40,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:29:40,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:40,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash -924068299, now seen corresponding path program 1 times [2025-03-03 14:29:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-03 14:29:40,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:40,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:29:40,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:29:40,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:40,786 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:29:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-03 14:29:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109224028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452994855] [2025-03-03 14:29:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:40,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:40,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:40,787 INFO L87 Difference]: Start difference. First operand 219 states and 282 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:29:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:40,824 INFO L93 Difference]: Finished difference Result 436 states and 572 transitions. [2025-03-03 14:29:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:29:40,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-03 14:29:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:40,827 INFO L225 Difference]: With dead ends: 436 [2025-03-03 14:29:40,827 INFO L226 Difference]: Without dead ends: 225 [2025-03-03 14:29:40,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:40,828 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:40,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-03 14:29:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-03 14:29:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 185 states have internal predecessors, (224), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2025-03-03 14:29:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2025-03-03 14:29:40,845 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 43 [2025-03-03 14:29:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:40,845 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2025-03-03 14:29:40,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:29:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2025-03-03 14:29:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:29:40,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:40,848 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:40,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:29:40,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:40,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1768540170, now seen corresponding path program 1 times [2025-03-03 14:29:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697245483] [2025-03-03 14:29:40,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:40,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:29:40,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:29:40,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:40,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:40,945 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:29:40,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:40,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697245483] [2025-03-03 14:29:40,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697245483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:40,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:40,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111236102] [2025-03-03 14:29:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:40,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:40,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:40,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:40,947 INFO L87 Difference]: Start difference. First operand 225 states and 288 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:29:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:40,995 INFO L93 Difference]: Finished difference Result 450 states and 593 transitions. [2025-03-03 14:29:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:29:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-03 14:29:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:40,999 INFO L225 Difference]: With dead ends: 450 [2025-03-03 14:29:41,000 INFO L226 Difference]: Without dead ends: 233 [2025-03-03 14:29:41,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:29:41,001 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 80 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:41,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-03 14:29:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2025-03-03 14:29:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 189 states have internal predecessors, (228), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2025-03-03 14:29:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2025-03-03 14:29:41,022 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 43 [2025-03-03 14:29:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:41,023 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2025-03-03 14:29:41,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:29:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2025-03-03 14:29:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:29:41,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:41,025 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:29:41,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1345838344, now seen corresponding path program 1 times [2025-03-03 14:29:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:41,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244962656] [2025-03-03 14:29:41,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:41,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:29:41,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:29:41,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:41,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:41,097 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:29:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244962656] [2025-03-03 14:29:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244962656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:29:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208655506] [2025-03-03 14:29:41,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:41,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:29:41,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:41,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:29:41,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:41,101 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:29:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:41,209 INFO L93 Difference]: Finished difference Result 752 states and 990 transitions. [2025-03-03 14:29:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:29:41,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-03-03 14:29:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:41,215 INFO L225 Difference]: With dead ends: 752 [2025-03-03 14:29:41,217 INFO L226 Difference]: Without dead ends: 531 [2025-03-03 14:29:41,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:41,218 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 128 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:41,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 318 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:29:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-03 14:29:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2025-03-03 14:29:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 392 states have (on average 1.2831632653061225) internal successors, (503), 421 states have internal predecessors, (503), 64 states have call successors, (64), 60 states have call predecessors, (64), 62 states have return successors, (100), 60 states have call predecessors, (100), 64 states have call successors, (100) [2025-03-03 14:29:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 667 transitions. [2025-03-03 14:29:41,264 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 667 transitions. Word has length 43 [2025-03-03 14:29:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:41,264 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 667 transitions. [2025-03-03 14:29:41,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:29:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 667 transitions. [2025-03-03 14:29:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:29:41,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:41,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:41,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:29:41,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:41,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash -697739050, now seen corresponding path program 1 times [2025-03-03 14:29:41,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:41,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418984429] [2025-03-03 14:29:41,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:41,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:29:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:29:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:41,354 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:29:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418984429] [2025-03-03 14:29:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418984429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:29:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970272275] [2025-03-03 14:29:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:41,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:41,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:41,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:41,356 INFO L87 Difference]: Start difference. First operand 519 states and 667 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 14:29:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:41,401 INFO L93 Difference]: Finished difference Result 859 states and 1139 transitions. [2025-03-03 14:29:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-03 14:29:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:41,409 INFO L225 Difference]: With dead ends: 859 [2025-03-03 14:29:41,409 INFO L226 Difference]: Without dead ends: 857 [2025-03-03 14:29:41,410 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:29:41,411 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 71 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:41,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 183 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-03 14:29:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 817. [2025-03-03 14:29:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 614 states have (on average 1.291530944625407) internal successors, (793), 665 states have internal predecessors, (793), 104 states have call successors, (104), 96 states have call predecessors, (104), 98 states have return successors, (193), 90 states have call predecessors, (193), 104 states have call successors, (193) [2025-03-03 14:29:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1090 transitions. [2025-03-03 14:29:41,460 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1090 transitions. Word has length 47 [2025-03-03 14:29:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:41,460 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1090 transitions. [2025-03-03 14:29:41,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 14:29:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1090 transitions. [2025-03-03 14:29:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:29:41,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:41,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-03-03 14:29:41,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:29:41,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:41,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1693584629, now seen corresponding path program 1 times [2025-03-03 14:29:41,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:41,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401341081] [2025-03-03 14:29:41,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:41,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:29:41,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:29:41,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:29:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:41,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401341081] [2025-03-03 14:29:41,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401341081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:41,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:29:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519388318] [2025-03-03 14:29:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:29:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:41,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:29:41,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:41,515 INFO L87 Difference]: Start difference. First operand 817 states and 1090 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:29:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:41,591 INFO L93 Difference]: Finished difference Result 933 states and 1247 transitions. [2025-03-03 14:29:41,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:29:41,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 80 [2025-03-03 14:29:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:41,594 INFO L225 Difference]: With dead ends: 933 [2025-03-03 14:29:41,594 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 14:29:41,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:41,596 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 120 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:41,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 239 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 14:29:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 389. [2025-03-03 14:29:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 296 states have (on average 1.25) internal successors, (370), 316 states have internal predecessors, (370), 45 states have call successors, (45), 45 states have call predecessors, (45), 47 states have return successors, (87), 43 states have call predecessors, (87), 45 states have call successors, (87) [2025-03-03 14:29:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 502 transitions. [2025-03-03 14:29:41,651 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 502 transitions. Word has length 80 [2025-03-03 14:29:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:41,651 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 502 transitions. [2025-03-03 14:29:41,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:29:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 502 transitions. [2025-03-03 14:29:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:29:41,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:41,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:41,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:29:41,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:41,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1654218878, now seen corresponding path program 1 times [2025-03-03 14:29:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410003488] [2025-03-03 14:29:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:41,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:29:41,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:29:41,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:41,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:29:41,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410003488] [2025-03-03 14:29:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410003488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:29:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019285229] [2025-03-03 14:29:41,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:29:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:41,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:29:41,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:29:41,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:29:41,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:29:41,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:41,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:41,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:29:41,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:29:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:29:41,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:29:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019285229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:41,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:29:41,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 14:29:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721965075] [2025-03-03 14:29:41,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:41,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:41,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:41,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:41,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:29:41,903 INFO L87 Difference]: Start difference. First operand 389 states and 502 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:29:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:41,941 INFO L93 Difference]: Finished difference Result 687 states and 918 transitions. [2025-03-03 14:29:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2025-03-03 14:29:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:41,943 INFO L225 Difference]: With dead ends: 687 [2025-03-03 14:29:41,944 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:29:41,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:29:41,948 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:41,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 189 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:29:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 272. [2025-03-03 14:29:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 207 states have (on average 1.21256038647343) internal successors, (251), 220 states have internal predecessors, (251), 31 states have call successors, (31), 31 states have call predecessors, (31), 33 states have return successors, (43), 29 states have call predecessors, (43), 31 states have call successors, (43) [2025-03-03 14:29:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 325 transitions. [2025-03-03 14:29:41,983 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 325 transitions. Word has length 84 [2025-03-03 14:29:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:41,984 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 325 transitions. [2025-03-03 14:29:41,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:29:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 325 transitions. [2025-03-03 14:29:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:29:41,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:41,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:41,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:29:42,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:29:42,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:42,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1736143634, now seen corresponding path program 1 times [2025-03-03 14:29:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:42,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466117693] [2025-03-03 14:29:42,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:42,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:29:42,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:29:42,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:42,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:29:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466117693] [2025-03-03 14:29:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466117693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:29:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994941112] [2025-03-03 14:29:42,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:42,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:29:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:42,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:29:42,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:29:42,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:29:42,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:29:42,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:42,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:42,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:29:42,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:29:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:29:42,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:29:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:29:42,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994941112] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 14:29:42,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 14:29:42,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 5] total 10 [2025-03-03 14:29:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827798106] [2025-03-03 14:29:42,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:42,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:29:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:42,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:29:42,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:29:42,627 INFO L87 Difference]: Start difference. First operand 272 states and 325 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:29:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:42,721 INFO L93 Difference]: Finished difference Result 765 states and 932 transitions. [2025-03-03 14:29:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:29:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2025-03-03 14:29:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:42,725 INFO L225 Difference]: With dead ends: 765 [2025-03-03 14:29:42,725 INFO L226 Difference]: Without dead ends: 501 [2025-03-03 14:29:42,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:29:42,727 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 49 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:42,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 400 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-03 14:29:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 469. [2025-03-03 14:29:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 353 states have (on average 1.1898016997167138) internal successors, (420), 376 states have internal predecessors, (420), 56 states have call successors, (56), 56 states have call predecessors, (56), 59 states have return successors, (79), 51 states have call predecessors, (79), 56 states have call successors, (79) [2025-03-03 14:29:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 555 transitions. [2025-03-03 14:29:42,766 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 555 transitions. Word has length 87 [2025-03-03 14:29:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:42,767 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 555 transitions. [2025-03-03 14:29:42,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:29:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 555 transitions. [2025-03-03 14:29:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:29:42,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:42,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:42,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:29:42,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:29:42,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1427730925, now seen corresponding path program 1 times [2025-03-03 14:29:42,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085287944] [2025-03-03 14:29:42,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:42,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:42,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:29:42,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:29:42,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:42,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:29:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085287944] [2025-03-03 14:29:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085287944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:29:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532935847] [2025-03-03 14:29:43,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:43,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:29:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:43,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:29:43,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:29:43,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:29:43,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:29:43,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:43,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:43,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:29:43,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:29:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:29:43,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:29:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532935847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:43,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:29:43,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2025-03-03 14:29:43,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111340188] [2025-03-03 14:29:43,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:43,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:29:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:43,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:29:43,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:29:43,268 INFO L87 Difference]: Start difference. First operand 469 states and 555 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:29:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:43,422 INFO L93 Difference]: Finished difference Result 1271 states and 1585 transitions. [2025-03-03 14:29:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:29:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2025-03-03 14:29:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:43,426 INFO L225 Difference]: With dead ends: 1271 [2025-03-03 14:29:43,426 INFO L226 Difference]: Without dead ends: 898 [2025-03-03 14:29:43,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:29:43,428 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 106 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:43,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 520 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:29:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-03 14:29:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 862. [2025-03-03 14:29:43,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 642 states have (on average 1.1838006230529594) internal successors, (760), 682 states have internal predecessors, (760), 108 states have call successors, (108), 108 states have call predecessors, (108), 111 states have return successors, (168), 99 states have call predecessors, (168), 108 states have call successors, (168) [2025-03-03 14:29:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1036 transitions. [2025-03-03 14:29:43,476 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1036 transitions. Word has length 91 [2025-03-03 14:29:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:43,476 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1036 transitions. [2025-03-03 14:29:43,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:29:43,476 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1036 transitions. [2025-03-03 14:29:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:29:43,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:43,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:43,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:29:43,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:29:43,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:43,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1360724172, now seen corresponding path program 1 times [2025-03-03 14:29:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:43,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788965767] [2025-03-03 14:29:43,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:43,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:29:43,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:29:43,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:43,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:29:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788965767] [2025-03-03 14:29:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788965767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633966026] [2025-03-03 14:29:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:43,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:43,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:43,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:43,748 INFO L87 Difference]: Start difference. First operand 862 states and 1036 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:29:43,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:43,782 INFO L93 Difference]: Finished difference Result 1177 states and 1413 transitions. [2025-03-03 14:29:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:29:43,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2025-03-03 14:29:43,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:43,784 INFO L225 Difference]: With dead ends: 1177 [2025-03-03 14:29:43,784 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:29:43,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:43,786 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:43,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:29:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:29:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:29:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:29:43,787 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2025-03-03 14:29:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:43,787 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:29:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:29:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:29:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:29:43,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:29:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:29:43,792 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:43,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:29:46,858 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:29:46,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:29:46 BoogieIcfgContainer [2025-03-03 14:29:46,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:29:46,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:29:46,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:29:46,868 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:29:46,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:29:39" (3/4) ... [2025-03-03 14:29:46,870 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:29:46,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-03-03 14:29:46,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-03 14:29:46,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-03 14:29:46,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-03 14:29:46,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-03 14:29:46,874 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-03 14:29:46,875 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:29:46,875 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-03 14:29:46,878 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-03 14:29:46,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-03 14:29:46,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 14:29:46,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:29:46,880 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:29:46,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:29:46,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:29:46,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:29:46,940 INFO L158 Benchmark]: Toolchain (without parser) took 7790.07ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.3MB in the beginning and 184.3MB in the end (delta: -80.0MB). Peak memory consumption was 110.9MB. Max. memory is 16.1GB. [2025-03-03 14:29:46,940 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:29:46,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.04ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 85.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:46,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.30ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:46,941 INFO L158 Benchmark]: Boogie Preprocessor took 34.11ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:29:46,941 INFO L158 Benchmark]: IcfgBuilder took 372.34ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 62.1MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:46,941 INFO L158 Benchmark]: TraceAbstraction took 6955.12ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 62.1MB in the beginning and 192.5MB in the end (delta: -130.4MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:46,941 INFO L158 Benchmark]: Witness Printer took 71.06ms. Allocated memory is still 335.5MB. Free memory was 192.5MB in the beginning and 184.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:46,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.04ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 85.0MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.30ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.11ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 81.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 372.34ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 62.1MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6955.12ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 62.1MB in the beginning and 192.5MB in the end (delta: -130.4MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. * Witness Printer took 71.06ms. Allocated memory is still 335.5MB. Free memory was 192.5MB in the beginning and 184.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [343] - GenericResultAtLocation [Line: 383]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [383] - GenericResultAtLocation [Line: 421]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [421] - GenericResultAtLocation [Line: 525]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [525] - GenericResultAtLocation [Line: 622]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [622] - GenericResultAtLocation [Line: 631]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [631] * 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 - PositiveResult [Line: 627]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 739 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 3769 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2322 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 1447 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=862occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 215 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1054 ConstructedInterpolants, 0 QuantifiedInterpolants, 2034 SizeOfPredicates, 4 NumberOfNonLiveVariables, 920 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 231/248 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 537]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2025-03-03 14:29:46,959 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 Result: TRUE