./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product51.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_spec5_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 1ef39c14b0f41147d1df64069011556a64ce74ff520b071f62407c2225292c50 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:56:08,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:56:08,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:56:08,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:56:08,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:56:08,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:56:08,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:56:08,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:56:08,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:56:08,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:56:08,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:56:08,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:56:08,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:56:08,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:56:08,361 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:56:08,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:56:08,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:56:08,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:56:08,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:56:08,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:56:08,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:56:08,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:56:08,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:56:08,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:56:08,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:56:08,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:56:08,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:56:08,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:56:08,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:56:08,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:56:08,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:56:08,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:56:08,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:56:08,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:56:08,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:56:08,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:56:08,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:56:08,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:56:08,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:56:08,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:56:08,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:56:08,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:56:08,369 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 1ef39c14b0f41147d1df64069011556a64ce74ff520b071f62407c2225292c50 [2024-11-11 20:56:08,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:56:08,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:56:08,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:56:08,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:56:08,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:56:08,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product51.cil.c [2024-11-11 20:56:09,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:56:09,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:56:09,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product51.cil.c [2024-11-11 20:56:10,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1618407c2/af06a4d52308430d980239e9ddd8fae7/FLAGdd9ae839a [2024-11-11 20:56:10,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1618407c2/af06a4d52308430d980239e9ddd8fae7 [2024-11-11 20:56:10,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:56:10,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:56:10,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:56:10,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:56:10,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:56:10,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bea146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10, skipping insertion in model container [2024-11-11 20:56:10,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:56:10,316 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_spec5_product51.cil.c[18485,18498] [2024-11-11 20:56:10,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:56:10,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:56:10,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [49] [2024-11-11 20:56:10,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [277] [2024-11-11 20:56:10,344 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [381] [2024-11-11 20:56:10,344 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [448] [2024-11-11 20:56:10,344 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [483] [2024-11-11 20:56:10,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [849] [2024-11-11 20:56:10,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [953] [2024-11-11 20:56:10,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [962] [2024-11-11 20:56:10,403 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_spec5_product51.cil.c[18485,18498] [2024-11-11 20:56:10,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:56:10,421 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:56:10,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10 WrapperNode [2024-11-11 20:56:10,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:56:10,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:56:10,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:56:10,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:56:10,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,456 INFO L138 Inliner]: procedures = 58, calls = 103, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 212 [2024-11-11 20:56:10,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:56:10,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:56:10,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:56:10,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:56:10,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,481 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]. [2024-11-11 20:56:10,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:56:10,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:56:10,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:56:10,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:56:10,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (1/1) ... [2024-11-11 20:56:10,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:56:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:10,523 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) [2024-11-11 20:56:10,526 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 [2024-11-11 20:56:10,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:56:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:56:10,564 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:56:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:56:10,564 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:56:10,564 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:56:10,564 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:56:10,565 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:56:10,565 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:56:10,565 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:56:10,565 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:56:10,565 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-11 20:56:10,565 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-11 20:56:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:56:10,566 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:56:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:56:10,566 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:56:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:56:10,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:56:10,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:56:10,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:56:10,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:56:10,856 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-11 20:56:10,856 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:56:10,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:56:10,871 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:56:10,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:56:10 BoogieIcfgContainer [2024-11-11 20:56:10,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:56:10,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:56:10,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:56:10,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:56:10,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:56:10" (1/3) ... [2024-11-11 20:56:10,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c553452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:56:10, skipping insertion in model container [2024-11-11 20:56:10,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:10" (2/3) ... [2024-11-11 20:56:10,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c553452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:56:10, skipping insertion in model container [2024-11-11 20:56:10,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:56:10" (3/3) ... [2024-11-11 20:56:10,878 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product51.cil.c [2024-11-11 20:56:10,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:56:10,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:56:10,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:56:10,952 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;@2eac96cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:56:10,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:56:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 84 states have internal predecessors, (103), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 20:56:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 20:56:10,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:10,965 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:10,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:10,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash 764297473, now seen corresponding path program 1 times [2024-11-11 20:56:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:10,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488277746] [2024-11-11 20:56:10,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 20:56:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:56:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488277746] [2024-11-11 20:56:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488277746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:56:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307120138] [2024-11-11 20:56:11,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:56:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:56:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:56:11,212 INFO L87 Difference]: Start difference. First operand has 99 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 84 states have internal predecessors, (103), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:56:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:11,245 INFO L93 Difference]: Finished difference Result 189 states and 256 transitions. [2024-11-11 20:56:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:56:11,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-11 20:56:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:11,256 INFO L225 Difference]: With dead ends: 189 [2024-11-11 20:56:11,256 INFO L226 Difference]: Without dead ends: 90 [2024-11-11 20:56:11,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:56:11,262 INFO L435 NwaCegarLoop]: 125 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, 125 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 [2024-11-11 20:56:11,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:56:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-11 20:56:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-11 20:56:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 76 states have internal predecessors, (89), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:56:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2024-11-11 20:56:11,305 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 32 [2024-11-11 20:56:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:11,307 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2024-11-11 20:56:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:56:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2024-11-11 20:56:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 20:56:11,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:11,311 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:11,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:56:11,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:11,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash -297054839, now seen corresponding path program 1 times [2024-11-11 20:56:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547160932] [2024-11-11 20:56:11,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:56:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:56:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547160932] [2024-11-11 20:56:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547160932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:56:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968931632] [2024-11-11 20:56:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:11,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:56:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:11,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:56:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:56:11,508 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:56:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:11,697 INFO L93 Difference]: Finished difference Result 309 states and 412 transitions. [2024-11-11 20:56:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:56:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-11 20:56:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:11,702 INFO L225 Difference]: With dead ends: 309 [2024-11-11 20:56:11,703 INFO L226 Difference]: Without dead ends: 227 [2024-11-11 20:56:11,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:56:11,705 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 201 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:11,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 531 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-11 20:56:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2024-11-11 20:56:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.329268292682927) internal successors, (218), 182 states have internal predecessors, (218), 37 states have call successors, (37), 22 states have call predecessors, (37), 19 states have return successors, (37), 26 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-11 20:56:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 292 transitions. [2024-11-11 20:56:11,744 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 292 transitions. Word has length 37 [2024-11-11 20:56:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:11,744 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 292 transitions. [2024-11-11 20:56:11,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:56:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 292 transitions. [2024-11-11 20:56:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 20:56:11,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:11,748 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:11,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:56:11,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:11,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1133604870, now seen corresponding path program 1 times [2024-11-11 20:56:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:11,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93693431] [2024-11-11 20:56:11,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:11,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:56:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:56:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:56:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:11,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:11,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93693431] [2024-11-11 20:56:11,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93693431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:11,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:11,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:56:11,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549863364] [2024-11-11 20:56:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:11,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:56:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:56:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:56:11,818 INFO L87 Difference]: Start difference. First operand 221 states and 292 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:56:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:11,903 INFO L93 Difference]: Finished difference Result 370 states and 484 transitions. [2024-11-11 20:56:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:56:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-11-11 20:56:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:11,906 INFO L225 Difference]: With dead ends: 370 [2024-11-11 20:56:11,906 INFO L226 Difference]: Without dead ends: 222 [2024-11-11 20:56:11,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:56:11,908 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 69 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 181 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-11 20:56:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 194. [2024-11-11 20:56:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 164 states have internal predecessors, (197), 28 states have call successors, (28), 19 states have call predecessors, (28), 19 states have return successors, (29), 20 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-11 20:56:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2024-11-11 20:56:11,933 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 43 [2024-11-11 20:56:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:11,934 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2024-11-11 20:56:11,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:56:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2024-11-11 20:56:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 20:56:11,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:11,936 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:56:11,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1125311, now seen corresponding path program 1 times [2024-11-11 20:56:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086818160] [2024-11-11 20:56:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:56:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 20:56:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:56:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086818160] [2024-11-11 20:56:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086818160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:12,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:56:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686905832] [2024-11-11 20:56:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:12,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:56:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:56:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:56:12,080 INFO L87 Difference]: Start difference. First operand 194 states and 254 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:56:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:12,201 INFO L93 Difference]: Finished difference Result 463 states and 620 transitions. [2024-11-11 20:56:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:56:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-11 20:56:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:12,204 INFO L225 Difference]: With dead ends: 463 [2024-11-11 20:56:12,206 INFO L226 Difference]: Without dead ends: 277 [2024-11-11 20:56:12,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:56:12,208 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 71 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:12,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 446 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:12,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-11 20:56:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-11-11 20:56:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 207 states have (on average 1.289855072463768) internal successors, (267), 224 states have internal predecessors, (267), 37 states have call successors, (37), 30 states have call predecessors, (37), 30 states have return successors, (47), 34 states have call predecessors, (47), 37 states have call successors, (47) [2024-11-11 20:56:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 351 transitions. [2024-11-11 20:56:12,244 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 351 transitions. Word has length 41 [2024-11-11 20:56:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:12,244 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 351 transitions. [2024-11-11 20:56:12,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:56:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 351 transitions. [2024-11-11 20:56:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:56:12,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:12,246 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:56:12,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1784621037, now seen corresponding path program 1 times [2024-11-11 20:56:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:12,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800475120] [2024-11-11 20:56:12,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:56:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:56:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800475120] [2024-11-11 20:56:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800475120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:56:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493147857] [2024-11-11 20:56:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:12,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:56:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:56:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:56:12,368 INFO L87 Difference]: Start difference. First operand 275 states and 351 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:56:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:12,506 INFO L93 Difference]: Finished difference Result 596 states and 770 transitions. [2024-11-11 20:56:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:56:12,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:56:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:12,511 INFO L225 Difference]: With dead ends: 596 [2024-11-11 20:56:12,511 INFO L226 Difference]: Without dead ends: 329 [2024-11-11 20:56:12,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:56:12,515 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 56 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:12,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 386 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-11 20:56:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-11-11 20:56:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 249 states have (on average 1.2730923694779117) internal successors, (317), 266 states have internal predecessors, (317), 41 states have call successors, (41), 30 states have call predecessors, (41), 36 states have return successors, (57), 42 states have call predecessors, (57), 41 states have call successors, (57) [2024-11-11 20:56:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 415 transitions. [2024-11-11 20:56:12,545 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 415 transitions. Word has length 51 [2024-11-11 20:56:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:12,546 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 415 transitions. [2024-11-11 20:56:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:56:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 415 transitions. [2024-11-11 20:56:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:56:12,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:12,547 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:12,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:56:12,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:12,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash 95677295, now seen corresponding path program 1 times [2024-11-11 20:56:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:12,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312030430] [2024-11-11 20:56:12,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:56:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:56:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312030430] [2024-11-11 20:56:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312030430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:56:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562713177] [2024-11-11 20:56:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:12,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:56:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:56:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:56:12,690 INFO L87 Difference]: Start difference. First operand 327 states and 415 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:56:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:12,841 INFO L93 Difference]: Finished difference Result 652 states and 847 transitions. [2024-11-11 20:56:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:56:12,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:56:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:12,845 INFO L225 Difference]: With dead ends: 652 [2024-11-11 20:56:12,845 INFO L226 Difference]: Without dead ends: 333 [2024-11-11 20:56:12,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:56:12,848 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 55 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:12,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 464 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-11 20:56:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2024-11-11 20:56:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 253 states have (on average 1.2687747035573123) internal successors, (321), 270 states have internal predecessors, (321), 41 states have call successors, (41), 30 states have call predecessors, (41), 36 states have return successors, (57), 42 states have call predecessors, (57), 41 states have call successors, (57) [2024-11-11 20:56:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 419 transitions. [2024-11-11 20:56:12,870 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 419 transitions. Word has length 51 [2024-11-11 20:56:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 419 transitions. [2024-11-11 20:56:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:56:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 419 transitions. [2024-11-11 20:56:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:56:12,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:12,872 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:12,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:56:12,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:12,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash 518379121, now seen corresponding path program 1 times [2024-11-11 20:56:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:12,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768972794] [2024-11-11 20:56:12,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:56:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 20:56:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:56:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:12,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768972794] [2024-11-11 20:56:12,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768972794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:12,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:12,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:56:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197400770] [2024-11-11 20:56:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:12,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:56:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:56:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:56:12,950 INFO L87 Difference]: Start difference. First operand 331 states and 419 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:56:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:13,144 INFO L93 Difference]: Finished difference Result 996 states and 1308 transitions. [2024-11-11 20:56:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:56:13,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:56:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:13,149 INFO L225 Difference]: With dead ends: 996 [2024-11-11 20:56:13,149 INFO L226 Difference]: Without dead ends: 673 [2024-11-11 20:56:13,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:56:13,152 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 224 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:13,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 319 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-11 20:56:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 666. [2024-11-11 20:56:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 505 states have (on average 1.2356435643564356) internal successors, (624), 534 states have internal predecessors, (624), 88 states have call successors, (88), 71 states have call predecessors, (88), 72 states have return successors, (133), 86 states have call predecessors, (133), 88 states have call successors, (133) [2024-11-11 20:56:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 845 transitions. [2024-11-11 20:56:13,197 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 845 transitions. Word has length 51 [2024-11-11 20:56:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:13,198 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 845 transitions. [2024-11-11 20:56:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:56:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 845 transitions. [2024-11-11 20:56:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 20:56:13,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:13,199 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 20:56:13,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:56:13,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:13,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1241994025, now seen corresponding path program 1 times [2024-11-11 20:56:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:13,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209271767] [2024-11-11 20:56:13,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 20:56:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:56:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:56:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:56:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:13,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209271767] [2024-11-11 20:56:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209271767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:13,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:56:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18978548] [2024-11-11 20:56:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:13,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:56:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:56:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:56:13,365 INFO L87 Difference]: Start difference. First operand 666 states and 845 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:56:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:13,845 INFO L93 Difference]: Finished difference Result 1981 states and 2612 transitions. [2024-11-11 20:56:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 20:56:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-11 20:56:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:13,853 INFO L225 Difference]: With dead ends: 1981 [2024-11-11 20:56:13,853 INFO L226 Difference]: Without dead ends: 1460 [2024-11-11 20:56:13,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:56:13,857 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 411 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:13,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 663 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:56:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-11-11 20:56:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1268. [2024-11-11 20:56:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 963 states have (on average 1.2315680166147456) internal successors, (1186), 1025 states have internal predecessors, (1186), 165 states have call successors, (165), 123 states have call predecessors, (165), 139 states have return successors, (253), 162 states have call predecessors, (253), 165 states have call successors, (253) [2024-11-11 20:56:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1604 transitions. [2024-11-11 20:56:13,950 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1604 transitions. Word has length 55 [2024-11-11 20:56:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:13,951 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1604 transitions. [2024-11-11 20:56:13,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:56:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1604 transitions. [2024-11-11 20:56:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 20:56:13,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:13,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 20:56:13,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:56:13,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:13,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:13,953 INFO L85 PathProgramCache]: Analyzing trace with hash 311034572, now seen corresponding path program 1 times [2024-11-11 20:56:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:13,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254042839] [2024-11-11 20:56:13,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:13,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:56:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:56:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:56:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:56:14,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254042839] [2024-11-11 20:56:14,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254042839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:14,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299318407] [2024-11-11 20:56:14,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:14,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:14,124 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) [2024-11-11 20:56:14,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:56:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:14,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:56:14,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:56:14,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:56:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 20:56:14,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299318407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:56:14,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:56:14,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2024-11-11 20:56:14,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838961103] [2024-11-11 20:56:14,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:56:14,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:56:14,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:14,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:56:14,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:56:14,518 INFO L87 Difference]: Start difference. First operand 1268 states and 1604 transitions. Second operand has 16 states, 16 states have (on average 7.5) internal successors, (120), 11 states have internal predecessors, (120), 5 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-11 20:56:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:15,458 INFO L93 Difference]: Finished difference Result 2830 states and 3713 transitions. [2024-11-11 20:56:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-11 20:56:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 11 states have internal predecessors, (120), 5 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 96 [2024-11-11 20:56:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:15,466 INFO L225 Difference]: With dead ends: 2830 [2024-11-11 20:56:15,467 INFO L226 Difference]: Without dead ends: 1701 [2024-11-11 20:56:15,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 210 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=1762, Unknown=0, NotChecked=0, Total=2162 [2024-11-11 20:56:15,472 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 380 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:15,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1293 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:56:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-11-11 20:56:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1422. [2024-11-11 20:56:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1064 states have (on average 1.211466165413534) internal successors, (1289), 1146 states have internal predecessors, (1289), 192 states have call successors, (192), 158 states have call predecessors, (192), 165 states have return successors, (262), 173 states have call predecessors, (262), 192 states have call successors, (262) [2024-11-11 20:56:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1743 transitions. [2024-11-11 20:56:15,553 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1743 transitions. Word has length 96 [2024-11-11 20:56:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:15,554 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 1743 transitions. [2024-11-11 20:56:15,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 11 states have internal predecessors, (120), 5 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-11 20:56:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1743 transitions. [2024-11-11 20:56:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 20:56:15,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:15,558 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:56:15,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:56:15,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:15,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:15,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash -562445059, now seen corresponding path program 1 times [2024-11-11 20:56:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:15,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304173607] [2024-11-11 20:56:15,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:56:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:56:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:56:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:56:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:56:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 20:56:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 20:56:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-11 20:56:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-11 20:56:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304173607] [2024-11-11 20:56:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304173607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:56:15,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:56:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:56:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032180314] [2024-11-11 20:56:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:56:15,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:56:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:56:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:56:15,898 INFO L87 Difference]: Start difference. First operand 1422 states and 1743 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:56:16,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:16,155 INFO L93 Difference]: Finished difference Result 2723 states and 3360 transitions. [2024-11-11 20:56:16,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:56:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 175 [2024-11-11 20:56:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:16,161 INFO L225 Difference]: With dead ends: 2723 [2024-11-11 20:56:16,161 INFO L226 Difference]: Without dead ends: 1440 [2024-11-11 20:56:16,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:56:16,164 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 153 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:16,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 371 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:56:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-11 20:56:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2024-11-11 20:56:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1082 states have (on average 1.2079482439926064) internal successors, (1307), 1164 states have internal predecessors, (1307), 192 states have call successors, (192), 158 states have call predecessors, (192), 165 states have return successors, (262), 173 states have call predecessors, (262), 192 states have call successors, (262) [2024-11-11 20:56:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1761 transitions. [2024-11-11 20:56:16,228 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1761 transitions. Word has length 175 [2024-11-11 20:56:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:16,228 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 1761 transitions. [2024-11-11 20:56:16,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:56:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1761 transitions. [2024-11-11 20:56:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-11 20:56:16,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:56:16,232 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 20:56:16,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:56:16,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:56:16,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:56:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1871308439, now seen corresponding path program 1 times [2024-11-11 20:56:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:56:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148215307] [2024-11-11 20:56:16,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:56:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:56:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:56:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 20:56:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:56:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:56:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:56:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:56:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:56:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:56:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 20:56:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 20:56:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-11 20:56:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 81 proven. 43 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-11 20:56:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:56:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148215307] [2024-11-11 20:56:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148215307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:56:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737976040] [2024-11-11 20:56:16,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:56:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:56:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:56:16,551 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) [2024-11-11 20:56:16,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:56:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:56:16,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 20:56:16,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:56:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 136 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-11 20:56:16,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:56:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 77 proven. 41 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 20:56:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737976040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:56:17,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:56:17,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 24 [2024-11-11 20:56:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790927549] [2024-11-11 20:56:17,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:56:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 20:56:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:56:17,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 20:56:17,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-11 20:56:17,091 INFO L87 Difference]: Start difference. First operand 1440 states and 1761 transitions. Second operand has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 21 states have internal predecessors, (230), 10 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-11 20:56:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:56:17,963 INFO L93 Difference]: Finished difference Result 3072 states and 3890 transitions. [2024-11-11 20:56:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 20:56:17,964 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 21 states have internal predecessors, (230), 10 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) Word has length 171 [2024-11-11 20:56:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:56:17,966 INFO L225 Difference]: With dead ends: 3072 [2024-11-11 20:56:17,966 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:56:17,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 364 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=514, Invalid=1936, Unknown=0, NotChecked=0, Total=2450 [2024-11-11 20:56:17,973 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 385 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:56:17,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 908 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:56:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:56:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:56:17,974 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) [2024-11-11 20:56:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:56:17,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2024-11-11 20:56:17,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:56:17,975 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:56:17,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.583333333333334) internal successors, (230), 21 states have internal predecessors, (230), 10 states have call successors, (33), 9 states have call predecessors, (33), 11 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2024-11-11 20:56:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:56:17,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:56:17,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:56:17,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:56:18,178 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 [2024-11-11 20:56:18,181 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:56:18,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:56:24,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:56:24,175 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1) (and (= 2 ~waterLevel~0) .cse0 .cse1)))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 (<= ~waterLevel~0 1) (<= 1 ~switchedOnBeforeTS~0) .cse1))) [2024-11-11 20:56:24,186 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|)) (.cse1 (not (= 0 ~systemActive~0))) (.cse2 (<= |old(~waterLevel~0)| 2))) (or (and .cse0 .cse1 (= |old(~waterLevel~0)| 2)) (and (<= 1 |old(~switchedOnBeforeTS~0)|) .cse2 .cse0 .cse1) (and (= |old(~pumpRunning~0)| 0) .cse2))) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (not (= 0 ~systemActive~0))) (.cse2 (<= ~waterLevel~0 2))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse2 (<= 1 ~switchedOnBeforeTS~0) .cse1) (and (= ~pumpRunning~0 0) .cse2))) [2024-11-11 20:56:24,197 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= ~waterLevel~0 1)) (.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (<= 1 ~switchedOnBeforeTS~0) (<= 1 |old(~pumpRunning~0)|) .cse1) (and (= 2 ~waterLevel~0) .cse2 .cse1) (and .cse0 .cse2 .cse1)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse2 (<= ~waterLevel~0 1)) (.cse1 (not (= 0 ~systemActive~0)))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and .cse0 .cse2 .cse1) (and (<= 1 ~pumpRunning~0) .cse2 (<= 1 ~switchedOnBeforeTS~0) .cse1))) [2024-11-11 20:56:24,204 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse1 (<= |old(~waterLevel~0)| 1)) (.cse2 (<= 1 ~pumpRunning~0)) (.cse3 (not (= 0 ~systemActive~0))) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (= |old(~waterLevel~0)| 2))) (or (and .cse0 .cse1) (and .cse2 .cse1 (<= 1 ~switchedOnBeforeTS~0) .cse3) (and .cse2 .cse3 .cse4) (and .cse0 .cse4))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= 2 ~waterLevel~0)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (not (= 0 ~systemActive~0))) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (<= ~waterLevel~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse0 .cse4 (<= 1 ~switchedOnBeforeTS~0) .cse2) (and .cse3 .cse4))) [2024-11-11 20:56:24,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:56:24 BoogieIcfgContainer [2024-11-11 20:56:24,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:56:24,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:56:24,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:56:24,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:56:24,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:56:10" (3/4) ... [2024-11-11 20:56:24,217 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:56:24,220 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-11 20:56:24,220 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:56:24,220 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:56:24,220 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:56:24,220 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:56:24,221 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:56:24,221 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:56:24,221 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-11 20:56:24,226 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-11 20:56:24,226 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:56:24,227 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:56:24,227 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:56:24,227 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:56:24,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:56:24,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:56:24,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:56:24,314 INFO L158 Benchmark]: Toolchain (without parser) took 14281.26ms. Allocated memory was 161.5MB in the beginning and 331.4MB in the end (delta: 169.9MB). Free memory was 104.9MB in the beginning and 290.7MB in the end (delta: -185.7MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,314 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:56:24,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.21ms. Allocated memory is still 161.5MB. Free memory was 104.7MB in the beginning and 82.5MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.62ms. Allocated memory is still 161.5MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,314 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 161.5MB. Free memory was 80.4MB in the beginning and 78.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,314 INFO L158 Benchmark]: RCFGBuilder took 376.43ms. Allocated memory is still 161.5MB. Free memory was 77.7MB in the beginning and 58.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,315 INFO L158 Benchmark]: TraceAbstraction took 13340.86ms. Allocated memory was 161.5MB in the beginning and 331.4MB in the end (delta: 169.9MB). Free memory was 58.5MB in the beginning and 106.2MB in the end (delta: -47.6MB). Peak memory consumption was 133.8MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,315 INFO L158 Benchmark]: Witness Printer took 98.53ms. Allocated memory is still 331.4MB. Free memory was 106.2MB in the beginning and 290.7MB in the end (delta: -184.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-11 20:56:24,316 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.21ms. Allocated memory is still 161.5MB. Free memory was 104.7MB in the beginning and 82.5MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.62ms. Allocated memory is still 161.5MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 161.5MB. Free memory was 80.4MB in the beginning and 78.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.43ms. Allocated memory is still 161.5MB. Free memory was 77.7MB in the beginning and 58.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13340.86ms. Allocated memory was 161.5MB in the beginning and 331.4MB in the end (delta: 169.9MB). Free memory was 58.5MB in the beginning and 106.2MB in the end (delta: -47.6MB). Peak memory consumption was 133.8MB. Max. memory is 16.1GB. * Witness Printer took 98.53ms. Allocated memory is still 331.4MB. Free memory was 106.2MB in the beginning and 290.7MB in the end (delta: -184.5MB). Peak memory consumption was 4.3MB. 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,"MinePump.i","") [49] - GenericResultAtLocation [Line: 277]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [277] - GenericResultAtLocation [Line: 381]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [381] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [448] - GenericResultAtLocation [Line: 483]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [483] - GenericResultAtLocation [Line: 849]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [849] - GenericResultAtLocation [Line: 953]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [953] - GenericResultAtLocation [Line: 962]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [962] * 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: 958]: 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, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2056 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2005 mSDsluCounter, 5687 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4447 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3362 IncrementalHoareTripleChecker+Invalid, 3890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 1240 mSDtfsCounter, 3362 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 834 GetRequests, 668 SyntacticMatches, 7 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1440occurred in iteration=10, InterpolantAutomatonStates: 139, 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, 11 MinimizatonAttempts, 518 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1322 ConstructedInterpolants, 0 QuantifiedInterpolants, 2722 SizeOfPredicates, 2 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 757/871 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: ((((((((1 <= pumpRunning) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive)) || (((pumpRunning == 0) && (2 == waterLevel)) && (splverifierCounter == 0))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (splverifierCounter == 0))) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 391]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 160]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: ((((pumpRunning == 0) && ((((waterLevel <= 1) && (1 <= switchedOnBeforeTS)) && (1 <= \old(pumpRunning))) || ((2 == waterLevel) && (1 <= \old(pumpRunning))))) && (0 != systemActive)) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 93]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (2 == waterLevel)) && (0 != systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: ((((((pumpRunning == 0) && (2 == waterLevel)) && (0 != systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 877]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 279]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 66]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((((1 <= pumpRunning) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 2))) Ensures: (((((((((((1 <= \old(pumpRunning)) && (0 != systemActive)) && (\old(waterLevel) == 2)) || ((((1 <= \old(switchedOnBeforeTS)) && (\old(waterLevel) <= 2)) && (1 <= \old(pumpRunning))) && (0 != systemActive))) || ((\old(pumpRunning) == 0) && (\old(waterLevel) <= 2))) && ((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && (((((((pumpRunning == \old(pumpRunning)) && (\old(waterLevel) == waterLevel)) && (1 <= switchedOnBeforeTS)) || (((pumpRunning == \old(pumpRunning)) && (((long long) waterLevel + 1) <= \old(waterLevel))) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (((long long) waterLevel + 1) <= \old(waterLevel))) && (1 <= switchedOnBeforeTS))) || (\old(pumpRunning) < 1)) || (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) && (1 <= switchedOnBeforeTS)))) && (((\old(waterLevel) != 2) || (\old(pumpRunning) < 1)) || (waterLevel == 1))) && ((((\old(waterLevel) != 1) || (((pumpRunning == \old(pumpRunning)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) || (\old(pumpRunning) < 1)) || (((pumpRunning == 0) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS)))) && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 101]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((((pumpRunning == 0) && (2 == waterLevel)) && (0 != systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: ((((((((waterLevel <= 1) && (1 <= switchedOnBeforeTS)) && (1 <= \old(pumpRunning))) && (0 != systemActive)) || ((\old(pumpRunning) == 0) && (0 != systemActive))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || ((pumpRunning == 0) && (waterLevel <= 1)))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 865]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (2 == waterLevel))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || ((pumpRunning == 0) && (waterLevel <= 1))) Ensures: ((((((2 == waterLevel) || (\old(waterLevel) != 2)) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((long long) \old(waterLevel) + 1) == waterLevel) || (2 == waterLevel))) && (((((pumpRunning == 0) && (\old(waterLevel) <= 1)) || ((((1 <= pumpRunning) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) || (((1 <= pumpRunning) && (0 != systemActive)) && (\old(waterLevel) == 2))) || ((pumpRunning == 0) && (\old(waterLevel) == 2)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) - ProcedureContractResult [Line: 179]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((1 <= pumpRunning) && (2 == waterLevel)) && (0 != systemActive)) || ((pumpRunning == 0) && (waterLevel <= 2))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 <= switchedOnBeforeTS)) && (0 != systemActive))) Ensures: ((((((pumpRunning < 1) || (0 != systemActive)) && (((pumpRunning == 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((1 <= pumpRunning) && (1 <= switchedOnBeforeTS)))) && (pumpRunning == \result)) && ((2 == waterLevel) || (waterLevel < 2))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:56:24,347 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