./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_spec2_product51.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 242c9b24ea8c293cca4af0028144a97f9048375edcd4379fb21e62564563d3d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:53:24,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:53:25,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:53:25,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:53:25,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:53:25,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:53:25,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:53:25,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:53:25,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:53:25,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:53:25,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:53:25,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:53:25,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:53:25,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:53:25,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:53:25,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:53:25,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:53:25,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:53:25,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:53:25,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:53:25,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:53:25,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:53:25,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:53:25,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:53:25,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:53:25,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:53:25,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:53:25,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:53:25,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:53:25,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:53:25,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:53:25,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:53:25,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:25,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:53:25,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:53:25,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:53:25,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:53:25,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:53:25,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:53:25,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:53:25,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:53:25,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:53:25,057 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 -> 242c9b24ea8c293cca4af0028144a97f9048375edcd4379fb21e62564563d3d5 [2024-11-11 20:53:25,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:53:25,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:53:25,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:53:25,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:53:25,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:53:25,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c [2024-11-11 20:53:26,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:53:26,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:53:26,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c [2024-11-11 20:53:27,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8696dd0c5/c27a0939225a4eeb9b86e43e0825fcba/FLAGa38782487 [2024-11-11 20:53:27,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8696dd0c5/c27a0939225a4eeb9b86e43e0825fcba [2024-11-11 20:53:27,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:53:27,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:53:27,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:27,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:53:27,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:53:27,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5650024b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27, skipping insertion in model container [2024-11-11 20:53:27,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:53:27,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c[9329,9342] [2024-11-11 20:53:27,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:27,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:53:27,754 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-11 20:53:27,756 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2024-11-11 20:53:27,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [343] [2024-11-11 20:53:27,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [383] [2024-11-11 20:53:27,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [421] [2024-11-11 20:53:27,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [525] [2024-11-11 20:53:27,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [622] [2024-11-11 20:53:27,758 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [631] [2024-11-11 20:53:27,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c[9329,9342] [2024-11-11 20:53:27,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:27,853 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:53:27,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27 WrapperNode [2024-11-11 20:53:27,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:27,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:27,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:53:27,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:53:27,862 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:53:27" (1/1) ... [2024-11-11 20:53:27,877 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:53:27" (1/1) ... [2024-11-11 20:53:27,913 INFO L138 Inliner]: procedures = 57, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 209 [2024-11-11 20:53:27,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:27,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:53:27,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:53:27,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:53:27,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,948 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:53:27,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:53:27,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:53:27,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:53:27,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:53:27,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (1/1) ... [2024-11-11 20:53:27,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:28,009 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:53:28,017 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:53:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:53:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:53:28,069 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:53:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:53:28,069 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:53:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:53:28,070 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:53:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:53:28,070 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:53:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:53:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:53:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:53:28,071 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:53:28,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:53:28,072 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:53:28,072 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:53:28,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:53:28,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:53:28,202 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:53:28,205 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:53:28,514 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-11 20:53:28,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:53:28,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:53:28,533 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:53:28,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:28 BoogieIcfgContainer [2024-11-11 20:53:28,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:53:28,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:53:28,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:53:28,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:53:28,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:53:27" (1/3) ... [2024-11-11 20:53:28,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16946120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:28, skipping insertion in model container [2024-11-11 20:53:28,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:27" (2/3) ... [2024-11-11 20:53:28,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16946120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:28, skipping insertion in model container [2024-11-11 20:53:28,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:28" (3/3) ... [2024-11-11 20:53:28,540 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product51.cil.c [2024-11-11 20:53:28,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:53:28,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:53:28,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:53:28,607 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;@44a9678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:53:28,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:53:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 81 states have internal predecessors, (100), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:53:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:53:28,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:28,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:28,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:28,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -6194419, now seen corresponding path program 1 times [2024-11-11 20:53:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103377906] [2024-11-11 20:53:28,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:53:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103377906] [2024-11-11 20:53:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103377906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372917015] [2024-11-11 20:53:28,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:28,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:53:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:53:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:28,853 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 81 states have internal predecessors, (100), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:28,879 INFO L93 Difference]: Finished difference Result 181 states and 246 transitions. [2024-11-11 20:53:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:53:28,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:53:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:28,888 INFO L225 Difference]: With dead ends: 181 [2024-11-11 20:53:28,888 INFO L226 Difference]: Without dead ends: 86 [2024-11-11 20:53:28,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:53:28,894 INFO L435 NwaCegarLoop]: 120 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, 120 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:53:28,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-11 20:53:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-11 20:53:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.323076923076923) internal successors, (86), 73 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:53:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-11 20:53:28,937 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 25 [2024-11-11 20:53:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:28,937 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-11 20:53:28,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2024-11-11 20:53:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:53:28,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:28,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:28,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:53:28,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:28,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1341011652, now seen corresponding path program 1 times [2024-11-11 20:53:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921509636] [2024-11-11 20:53:28,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:53:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:29,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921509636] [2024-11-11 20:53:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921509636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:29,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482759002] [2024-11-11 20:53:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:29,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:29,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:29,070 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:29,094 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2024-11-11 20:53:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:29,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:53:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:29,096 INFO L225 Difference]: With dead ends: 133 [2024-11-11 20:53:29,097 INFO L226 Difference]: Without dead ends: 77 [2024-11-11 20:53:29,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:29,100 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:29,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-11 20:53:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-11 20:53:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 67 states have internal predecessors, (79), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 20:53:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-11-11 20:53:29,116 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 26 [2024-11-11 20:53:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:29,118 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-11-11 20:53:29,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-11-11 20:53:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 20:53:29,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:29,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:53:29,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1026962067, now seen corresponding path program 1 times [2024-11-11 20:53:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083721264] [2024-11-11 20:53:29,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083721264] [2024-11-11 20:53:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083721264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820235235] [2024-11-11 20:53:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:29,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:29,313 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:29,532 INFO L93 Difference]: Finished difference Result 257 states and 338 transitions. [2024-11-11 20:53:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-11 20:53:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:29,535 INFO L225 Difference]: With dead ends: 257 [2024-11-11 20:53:29,535 INFO L226 Difference]: Without dead ends: 188 [2024-11-11 20:53:29,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:53:29,538 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 231 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:29,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 412 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-11 20:53:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2024-11-11 20:53:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 155 states have internal predecessors, (188), 25 states have call successors, (25), 19 states have call predecessors, (25), 19 states have return successors, (26), 17 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-11 20:53:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2024-11-11 20:53:29,569 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 30 [2024-11-11 20:53:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:29,569 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2024-11-11 20:53:29,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2024-11-11 20:53:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:53:29,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:29,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:29,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:53:29,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:29,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:29,573 INFO L85 PathProgramCache]: Analyzing trace with hash 591965277, now seen corresponding path program 1 times [2024-11-11 20:53:29,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:29,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272941272] [2024-11-11 20:53:29,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:29,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:29,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:29,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272941272] [2024-11-11 20:53:29,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272941272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:29,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:29,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:29,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496441598] [2024-11-11 20:53:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:29,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:29,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:29,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:29,760 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:29,887 INFO L93 Difference]: Finished difference Result 431 states and 580 transitions. [2024-11-11 20:53:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:29,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-11 20:53:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:29,890 INFO L225 Difference]: With dead ends: 431 [2024-11-11 20:53:29,890 INFO L226 Difference]: Without dead ends: 257 [2024-11-11 20:53:29,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:29,893 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 48 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:29,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 348 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-11 20:53:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2024-11-11 20:53:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 192 states have (on average 1.3125) internal successors, (252), 209 states have internal predecessors, (252), 32 states have call successors, (32), 30 states have call predecessors, (32), 30 states have return successors, (42), 29 states have call predecessors, (42), 32 states have call successors, (42) [2024-11-11 20:53:29,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 326 transitions. [2024-11-11 20:53:29,946 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 326 transitions. Word has length 34 [2024-11-11 20:53:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:29,947 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 326 transitions. [2024-11-11 20:53:29,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 326 transitions. [2024-11-11 20:53:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 20:53:29,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:29,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:29,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:53:29,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:29,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2050243753, now seen corresponding path program 1 times [2024-11-11 20:53:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962157636] [2024-11-11 20:53:29,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:53:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962157636] [2024-11-11 20:53:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962157636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873243607] [2024-11-11 20:53:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:30,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:30,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:30,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:30,085 INFO L87 Difference]: Start difference. First operand 255 states and 326 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:30,249 INFO L93 Difference]: Finished difference Result 556 states and 720 transitions. [2024-11-11 20:53:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 20:53:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:30,253 INFO L225 Difference]: With dead ends: 556 [2024-11-11 20:53:30,255 INFO L226 Difference]: Without dead ends: 309 [2024-11-11 20:53:30,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:53:30,258 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:30,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 356 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-11 20:53:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-11 20:53:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 234 states have (on average 1.2905982905982907) internal successors, (302), 251 states have internal predecessors, (302), 36 states have call successors, (36), 30 states have call predecessors, (36), 36 states have return successors, (52), 37 states have call predecessors, (52), 36 states have call successors, (52) [2024-11-11 20:53:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 390 transitions. [2024-11-11 20:53:30,307 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 390 transitions. Word has length 44 [2024-11-11 20:53:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 390 transitions. [2024-11-11 20:53:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 390 transitions. [2024-11-11 20:53:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 20:53:30,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:30,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:30,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:53:30,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 555779801, now seen corresponding path program 1 times [2024-11-11 20:53:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94963344] [2024-11-11 20:53:30,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:53:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:30,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94963344] [2024-11-11 20:53:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94963344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:30,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:30,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:30,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136945414] [2024-11-11 20:53:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:30,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:30,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:30,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:30,432 INFO L87 Difference]: Start difference. First operand 307 states and 390 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:30,554 INFO L93 Difference]: Finished difference Result 612 states and 797 transitions. [2024-11-11 20:53:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 20:53:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:30,559 INFO L225 Difference]: With dead ends: 612 [2024-11-11 20:53:30,559 INFO L226 Difference]: Without dead ends: 313 [2024-11-11 20:53:30,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:53:30,562 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 52 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:30,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 279 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-11 20:53:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2024-11-11 20:53:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 238 states have (on average 1.2857142857142858) internal successors, (306), 255 states have internal predecessors, (306), 36 states have call successors, (36), 30 states have call predecessors, (36), 36 states have return successors, (52), 37 states have call predecessors, (52), 36 states have call successors, (52) [2024-11-11 20:53:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 394 transitions. [2024-11-11 20:53:30,611 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 394 transitions. Word has length 44 [2024-11-11 20:53:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:30,612 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 394 transitions. [2024-11-11 20:53:30,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:30,612 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 394 transitions. [2024-11-11 20:53:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 20:53:30,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:30,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:30,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:53:30,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:30,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash 978481627, now seen corresponding path program 1 times [2024-11-11 20:53:30,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:30,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506367326] [2024-11-11 20:53:30,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:30,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 20:53:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:30,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506367326] [2024-11-11 20:53:30,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506367326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:30,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:30,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759606323] [2024-11-11 20:53:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:30,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:30,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:30,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:30,734 INFO L87 Difference]: Start difference. First operand 311 states and 394 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:30,995 INFO L93 Difference]: Finished difference Result 924 states and 1218 transitions. [2024-11-11 20:53:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:30,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 20:53:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:31,000 INFO L225 Difference]: With dead ends: 924 [2024-11-11 20:53:31,001 INFO L226 Difference]: Without dead ends: 621 [2024-11-11 20:53:31,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:53:31,004 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 214 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:31,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 300 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-11-11 20:53:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 614. [2024-11-11 20:53:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 466 states have (on average 1.2553648068669527) internal successors, (585), 495 states have internal predecessors, (585), 75 states have call successors, (75), 71 states have call predecessors, (75), 72 states have return successors, (120), 73 states have call predecessors, (120), 75 states have call successors, (120) [2024-11-11 20:53:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 780 transitions. [2024-11-11 20:53:31,058 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 780 transitions. Word has length 44 [2024-11-11 20:53:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:31,058 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 780 transitions. [2024-11-11 20:53:31,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 780 transitions. [2024-11-11 20:53:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 20:53:31,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:31,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:53:31,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:31,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash 319309813, now seen corresponding path program 1 times [2024-11-11 20:53:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191630230] [2024-11-11 20:53:31,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:31,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:53:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191630230] [2024-11-11 20:53:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191630230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250472458] [2024-11-11 20:53:31,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:31,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:31,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:31,162 INFO L87 Difference]: Start difference. First operand 614 states and 780 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:53:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:31,545 INFO L93 Difference]: Finished difference Result 1205 states and 1620 transitions. [2024-11-11 20:53:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:53:31,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-11 20:53:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:31,553 INFO L225 Difference]: With dead ends: 1205 [2024-11-11 20:53:31,553 INFO L226 Difference]: Without dead ends: 1203 [2024-11-11 20:53:31,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:31,554 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 302 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:31,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 227 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:53:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2024-11-11 20:53:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1063. [2024-11-11 20:53:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 808 states have (on average 1.25990099009901) internal successors, (1018), 869 states have internal predecessors, (1018), 134 states have call successors, (134), 104 states have call predecessors, (134), 120 states have return successors, (290), 125 states have call predecessors, (290), 134 states have call successors, (290) [2024-11-11 20:53:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1442 transitions. [2024-11-11 20:53:31,650 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1442 transitions. Word has length 48 [2024-11-11 20:53:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:31,650 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1442 transitions. [2024-11-11 20:53:31,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:53:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1442 transitions. [2024-11-11 20:53:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 20:53:31,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:31,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:31,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:53:31,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash 706311904, now seen corresponding path program 1 times [2024-11-11 20:53:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:31,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592153527] [2024-11-11 20:53:31,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:53:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:53:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:53:31,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592153527] [2024-11-11 20:53:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592153527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:31,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430455098] [2024-11-11 20:53:31,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:31,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:31,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:31,860 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:53:31,862 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:53:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:31,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:53:31,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:32,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430455098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2024-11-11 20:53:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547967083] [2024-11-11 20:53:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:32,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:32,084 INFO L87 Difference]: Start difference. First operand 1063 states and 1442 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:53:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,162 INFO L93 Difference]: Finished difference Result 1868 states and 2582 transitions. [2024-11-11 20:53:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2024-11-11 20:53:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,168 INFO L225 Difference]: With dead ends: 1868 [2024-11-11 20:53:32,168 INFO L226 Difference]: Without dead ends: 944 [2024-11-11 20:53:32,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:32,173 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 206 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-11 20:53:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2024-11-11 20:53:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 716 states have (on average 1.2318435754189945) internal successors, (882), 769 states have internal predecessors, (882), 119 states have call successors, (119), 99 states have call predecessors, (119), 108 states have return successors, (188), 109 states have call predecessors, (188), 119 states have call successors, (188) [2024-11-11 20:53:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1189 transitions. [2024-11-11 20:53:32,245 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1189 transitions. Word has length 86 [2024-11-11 20:53:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1189 transitions. [2024-11-11 20:53:32,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:53:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1189 transitions. [2024-11-11 20:53:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 20:53:32,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:32,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,266 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:53:32,449 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:53:32,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:32,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2067995951, now seen corresponding path program 1 times [2024-11-11 20:53:32,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123361283] [2024-11-11 20:53:32,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:53:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:53:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,653 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:53:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123361283] [2024-11-11 20:53:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123361283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816001058] [2024-11-11 20:53:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:32,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:32,655 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:53:32,657 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:53:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:32,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:53:32,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:53:32,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:32,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816001058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:32,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:32,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-11 20:53:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387254534] [2024-11-11 20:53:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:53:32,812 INFO L87 Difference]: Start difference. First operand 944 states and 1189 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:53:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:32,880 INFO L93 Difference]: Finished difference Result 1773 states and 2275 transitions. [2024-11-11 20:53:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-11 20:53:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:32,886 INFO L225 Difference]: With dead ends: 1773 [2024-11-11 20:53:32,887 INFO L226 Difference]: Without dead ends: 968 [2024-11-11 20:53:32,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:53:32,890 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:32,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-11-11 20:53:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2024-11-11 20:53:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 740 states have (on average 1.2243243243243243) internal successors, (906), 793 states have internal predecessors, (906), 119 states have call successors, (119), 99 states have call predecessors, (119), 108 states have return successors, (188), 109 states have call predecessors, (188), 119 states have call successors, (188) [2024-11-11 20:53:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1213 transitions. [2024-11-11 20:53:32,958 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1213 transitions. Word has length 89 [2024-11-11 20:53:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1213 transitions. [2024-11-11 20:53:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:53:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1213 transitions. [2024-11-11 20:53:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 20:53:32,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:32,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:53:33,165 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,SelfDestructingSolverStorable9 [2024-11-11 20:53:33,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:33,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1933982445, now seen corresponding path program 1 times [2024-11-11 20:53:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18187829] [2024-11-11 20:53:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:53:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:53:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:53:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:53:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:33,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18187829] [2024-11-11 20:53:33,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18187829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:33,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174901779] [2024-11-11 20:53:33,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:33,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:33,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:33,383 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:33,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:53:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:33,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:53:33,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 20:53:33,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 20:53:33,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174901779] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:33,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:53:33,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-11 20:53:33,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011484494] [2024-11-11 20:53:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:33,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:53:33,771 INFO L87 Difference]: Start difference. First operand 968 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:53:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:33,941 INFO L93 Difference]: Finished difference Result 2761 states and 3549 transitions. [2024-11-11 20:53:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:33,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-11 20:53:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:33,952 INFO L225 Difference]: With dead ends: 2761 [2024-11-11 20:53:33,952 INFO L226 Difference]: Without dead ends: 1801 [2024-11-11 20:53:33,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:53:33,957 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 57 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:33,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 443 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2024-11-11 20:53:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1616. [2024-11-11 20:53:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1222 states have (on average 1.1980360065466449) internal successors, (1464), 1314 states have internal predecessors, (1464), 202 states have call successors, (202), 170 states have call predecessors, (202), 191 states have return successors, (319), 190 states have call predecessors, (319), 202 states have call successors, (319) [2024-11-11 20:53:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1985 transitions. [2024-11-11 20:53:34,095 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1985 transitions. Word has length 89 [2024-11-11 20:53:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:34,095 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 1985 transitions. [2024-11-11 20:53:34,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:53:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1985 transitions. [2024-11-11 20:53:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:53:34,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:34,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:34,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 20:53:34,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:34,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:34,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash 816945655, now seen corresponding path program 1 times [2024-11-11 20:53:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821701968] [2024-11-11 20:53:34,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:53:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:53:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:53:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:53:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821701968] [2024-11-11 20:53:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821701968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707967796] [2024-11-11 20:53:34,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:34,493 INFO L229 MonitoredProcess]: Starting monitored process 5 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:53:34,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:53:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:34,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:53:34,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:34,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707967796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2024-11-11 20:53:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916540223] [2024-11-11 20:53:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:53:34,664 INFO L87 Difference]: Start difference. First operand 1616 states and 1985 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:53:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:34,837 INFO L93 Difference]: Finished difference Result 2626 states and 3264 transitions. [2024-11-11 20:53:34,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:34,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-11 20:53:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:34,845 INFO L225 Difference]: With dead ends: 2626 [2024-11-11 20:53:34,845 INFO L226 Difference]: Without dead ends: 1274 [2024-11-11 20:53:34,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:53:34,849 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 117 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:34,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 469 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-11 20:53:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1208. [2024-11-11 20:53:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 917 states have (on average 1.1962922573609596) internal successors, (1097), 977 states have internal predecessors, (1097), 141 states have call successors, (141), 137 states have call predecessors, (141), 149 states have return successors, (214), 140 states have call predecessors, (214), 141 states have call successors, (214) [2024-11-11 20:53:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1452 transitions. [2024-11-11 20:53:34,934 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1452 transitions. Word has length 93 [2024-11-11 20:53:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:34,935 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1452 transitions. [2024-11-11 20:53:34,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 20:53:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1452 transitions. [2024-11-11 20:53:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:53:34,937 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:34,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:53:35,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:35,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:35,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1340224605, now seen corresponding path program 1 times [2024-11-11 20:53:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580913905] [2024-11-11 20:53:35,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:35,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:53:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:53:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:53:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:53:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:53:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:53:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580913905] [2024-11-11 20:53:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580913905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082736683] [2024-11-11 20:53:35,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:35,226 INFO L229 MonitoredProcess]: Starting monitored process 6 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:53:35,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:53:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:35,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:53:35,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:53:35,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082736683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-11-11 20:53:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178812993] [2024-11-11 20:53:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:35,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:35,364 INFO L87 Difference]: Start difference. First operand 1208 states and 1452 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:35,418 INFO L93 Difference]: Finished difference Result 1508 states and 1832 transitions. [2024-11-11 20:53:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:35,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-11 20:53:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:35,421 INFO L225 Difference]: With dead ends: 1508 [2024-11-11 20:53:35,421 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:53:35,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:35,425 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:35,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 197 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:53:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:53:35,427 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:53:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:53:35,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-11-11 20:53:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:35,429 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:53:35,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:53:35,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:53:35,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:53:35,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:53:35,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 20:53:35,636 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:35,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:53:39,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:53:39,428 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= 2 ~waterLevel~0) .cse0 (not (= 0 ~systemActive~0))) (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0) .cse0)))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0))) (or (and .cse0 (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (and .cse0 (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)))) [2024-11-11 20:53:39,446 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (= ~methaneLevelCritical~0 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) Eliminated clause: (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse5 .cse3))) [2024-11-11 20:53:39,453 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:169) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-11 20:53:39,456 INFO L158 Benchmark]: Toolchain (without parser) took 12100.39ms. Allocated memory was 165.7MB in the beginning and 291.5MB in the end (delta: 125.8MB). Free memory was 123.4MB in the beginning and 236.8MB in the end (delta: -113.4MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:39,457 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:53:39,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.92ms. Allocated memory is still 165.7MB. Free memory was 123.4MB in the beginning and 101.5MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 20:53:39,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.75ms. Allocated memory is still 165.7MB. Free memory was 101.5MB in the beginning and 99.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:39,457 INFO L158 Benchmark]: Boogie Preprocessor took 47.98ms. Allocated memory is still 165.7MB. Free memory was 99.4MB in the beginning and 97.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:39,458 INFO L158 Benchmark]: RCFGBuilder took 569.48ms. Allocated memory is still 165.7MB. Free memory was 96.6MB in the beginning and 121.3MB in the end (delta: -24.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:39,458 INFO L158 Benchmark]: TraceAbstraction took 10920.75ms. Allocated memory was 165.7MB in the beginning and 291.5MB in the end (delta: 125.8MB). Free memory was 120.3MB in the beginning and 236.8MB in the end (delta: -116.6MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:39,459 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.19ms. Allocated memory is still 100.7MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.92ms. Allocated memory is still 165.7MB. Free memory was 123.4MB in the beginning and 101.5MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.75ms. Allocated memory is still 165.7MB. Free memory was 101.5MB in the beginning and 99.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.98ms. Allocated memory is still 165.7MB. Free memory was 99.4MB in the beginning and 97.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.48ms. Allocated memory is still 165.7MB. Free memory was 96.6MB in the beginning and 121.3MB in the end (delta: -24.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10920.75ms. Allocated memory was 165.7MB in the beginning and 291.5MB in the end (delta: 125.8MB). Free memory was 120.3MB in the beginning and 236.8MB in the end (delta: -116.6MB). Peak memory consumption was 163.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [343] - GenericResultAtLocation [Line: 383]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [383] - GenericResultAtLocation [Line: 421]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [421] - GenericResultAtLocation [Line: 525]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [525] - GenericResultAtLocation [Line: 622]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [622] - GenericResultAtLocation [Line: 631]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [631] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 627]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1191 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 3909 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2535 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 1374 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 643 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1616occurred in iteration=11, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 410 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1275 ConstructedInterpolants, 0 QuantifiedInterpolants, 2221 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1554 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 316/329 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: 65]: Loop Invariant Derived loop invariant: ((((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 226]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (2 <= waterLevel)) && (0 != systemActive)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((((pumpRunning == 0) && (((2 <= waterLevel) && (1 <= \old(pumpRunning))) || (((1 == systemActive) && (1 <= waterLevel)) && (1 <= \old(pumpRunning))))) && (0 != systemActive)) && ((((((systemActive == \old(systemActive)) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 159]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ExceptionOrErrorResult: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))): de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-11 20:53:39,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_spec2_product51.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 242c9b24ea8c293cca4af0028144a97f9048375edcd4379fb21e62564563d3d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:53:41,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:53:41,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 20:53:41,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:53:41,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:53:41,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:53:41,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:53:41,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:53:41,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:53:41,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:53:41,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:53:41,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:53:41,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:53:41,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:53:41,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:53:41,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:53:41,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:53:41,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:53:41,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:53:41,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:53:41,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:53:41,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:53:41,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:53:41,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 20:53:41,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 20:53:41,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:53:41,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 20:53:41,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:53:41,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:53:41,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:53:41,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:53:41,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:53:41,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:53:41,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:53:41,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:41,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:53:41,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:53:41,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:53:41,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 20:53:41,810 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 20:53:41,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:53:41,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:53:41,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:53:41,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:53:41,811 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 -> 242c9b24ea8c293cca4af0028144a97f9048375edcd4379fb21e62564563d3d5 [2024-11-11 20:53:42,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:53:42,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:53:42,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:53:42,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:53:42,174 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:53:42,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c [2024-11-11 20:53:43,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:53:43,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:53:43,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c [2024-11-11 20:53:43,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16996f144/10922f4e1d7b4003b3fad091dea34f0c/FLAGcb21b5414 [2024-11-11 20:53:44,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16996f144/10922f4e1d7b4003b3fad091dea34f0c [2024-11-11 20:53:44,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:53:44,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:53:44,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:44,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:53:44,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:53:44,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44250d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44, skipping insertion in model container [2024-11-11 20:53:44,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:53:44,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c[9329,9342] [2024-11-11 20:53:44,570 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,573 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,580 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,609 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,610 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,614 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-11 20:53:44,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:44,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:53:44,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-11 20:53:44,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2024-11-11 20:53:44,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [343] [2024-11-11 20:53:44,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [383] [2024-11-11 20:53:44,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [421] [2024-11-11 20:53:44,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [525] [2024-11-11 20:53:44,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [622] [2024-11-11 20:53:44,661 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [631] [2024-11-11 20:53:44,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product51.cil.c[9329,9342] [2024-11-11 20:53:44,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:44,775 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:53:44,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44 WrapperNode [2024-11-11 20:53:44,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:44,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:44,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:53:44,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:53:44,784 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:53:44" (1/1) ... [2024-11-11 20:53:44,806 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:53:44" (1/1) ... [2024-11-11 20:53:44,842 INFO L138 Inliner]: procedures = 59, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 198 [2024-11-11 20:53:44,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:44,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:53:44,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:53:44,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:53:44,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,888 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:53:44,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:53:44,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:53:44,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:53:44,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:53:44,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (1/1) ... [2024-11-11 20:53:44,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:44,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:44,943 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:53:44,950 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:53:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:53:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:53:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:53:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:53:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:53:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:53:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:53:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:53:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:53:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:53:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:53:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 20:53:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:53:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:53:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:53:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:53:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:53:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:53:45,087 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:53:45,089 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:53:45,390 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-11 20:53:45,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:53:45,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:53:45,405 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:53:45,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:45 BoogieIcfgContainer [2024-11-11 20:53:45,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:53:45,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:53:45,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:53:45,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:53:45,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:53:44" (1/3) ... [2024-11-11 20:53:45,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b89a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:45, skipping insertion in model container [2024-11-11 20:53:45,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:44" (2/3) ... [2024-11-11 20:53:45,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b89a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:45, skipping insertion in model container [2024-11-11 20:53:45,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:45" (3/3) ... [2024-11-11 20:53:45,418 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product51.cil.c [2024-11-11 20:53:45,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:53:45,444 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:53:45,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:53:45,521 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;@60f6763d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:53:45,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:53:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 81 states have internal predecessors, (100), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:53:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:53:45,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:45,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:45,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:45,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash -6194419, now seen corresponding path program 1 times [2024-11-11 20:53:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:45,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765580735] [2024-11-11 20:53:45,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:45,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:45,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:45,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 20:53:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:45,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:53:45,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:45,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:45,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765580735] [2024-11-11 20:53:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765580735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:45,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:45,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663447909] [2024-11-11 20:53:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:45,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:53:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:53:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:45,744 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 81 states have internal predecessors, (100), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:45,775 INFO L93 Difference]: Finished difference Result 181 states and 246 transitions. [2024-11-11 20:53:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:53:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:53:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:45,786 INFO L225 Difference]: With dead ends: 181 [2024-11-11 20:53:45,787 INFO L226 Difference]: Without dead ends: 86 [2024-11-11 20:53:45,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:53:45,798 INFO L435 NwaCegarLoop]: 120 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, 120 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:53:45,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-11 20:53:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-11 20:53:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.323076923076923) internal successors, (86), 73 states have internal predecessors, (86), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:53:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-11 20:53:45,849 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 25 [2024-11-11 20:53:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:45,851 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-11 20:53:45,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2024-11-11 20:53:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:53:45,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:45,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:45,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 20:53:46,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:46,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:46,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1341011652, now seen corresponding path program 1 times [2024-11-11 20:53:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486769985] [2024-11-11 20:53:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:46,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:46,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:46,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 20:53:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:46,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:53:46,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:46,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:46,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486769985] [2024-11-11 20:53:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486769985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:46,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514320063] [2024-11-11 20:53:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:46,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:46,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:46,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:46,203 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:46,227 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2024-11-11 20:53:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:53:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:46,229 INFO L225 Difference]: With dead ends: 133 [2024-11-11 20:53:46,229 INFO L226 Difference]: Without dead ends: 77 [2024-11-11 20:53:46,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:46,232 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:46,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-11 20:53:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-11 20:53:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 67 states have internal predecessors, (79), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-11 20:53:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-11-11 20:53:46,249 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 26 [2024-11-11 20:53:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:46,250 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-11-11 20:53:46,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-11-11 20:53:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 20:53:46,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:46,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:46,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 20:53:46,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:46,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:46,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1026962067, now seen corresponding path program 1 times [2024-11-11 20:53:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117278322] [2024-11-11 20:53:46,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:46,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 20:53:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:46,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:53:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:46,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:46,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:46,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117278322] [2024-11-11 20:53:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117278322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:46,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596811878] [2024-11-11 20:53:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:46,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:46,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:46,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:46,576 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:46,606 INFO L93 Difference]: Finished difference Result 214 states and 281 transitions. [2024-11-11 20:53:46,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:46,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-11 20:53:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:46,609 INFO L225 Difference]: With dead ends: 214 [2024-11-11 20:53:46,609 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 20:53:46,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:46,611 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:46,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 20:53:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-11-11 20:53:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 122 states have internal predecessors, (146), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 20:53:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2024-11-11 20:53:46,649 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 30 [2024-11-11 20:53:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:46,650 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2024-11-11 20:53:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2024-11-11 20:53:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 20:53:46,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:46,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:46,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-11 20:53:46,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:46,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 591965277, now seen corresponding path program 1 times [2024-11-11 20:53:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467442477] [2024-11-11 20:53:46,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:46,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:46,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:46,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-11 20:53:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:46,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:53:46,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:47,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:47,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467442477] [2024-11-11 20:53:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467442477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:47,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:47,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458533728] [2024-11-11 20:53:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:47,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:47,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:47,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:47,043 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:47,194 INFO L93 Difference]: Finished difference Result 402 states and 537 transitions. [2024-11-11 20:53:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-11 20:53:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:47,199 INFO L225 Difference]: With dead ends: 402 [2024-11-11 20:53:47,199 INFO L226 Difference]: Without dead ends: 268 [2024-11-11 20:53:47,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:53:47,201 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 62 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:47,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 439 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-11 20:53:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-11 20:53:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 199 states have (on average 1.3517587939698492) internal successors, (269), 228 states have internal predecessors, (269), 40 states have call successors, (40), 28 states have call predecessors, (40), 28 states have return successors, (42), 26 states have call predecessors, (42), 40 states have call successors, (42) [2024-11-11 20:53:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 351 transitions. [2024-11-11 20:53:47,232 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 351 transitions. Word has length 34 [2024-11-11 20:53:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:47,236 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 351 transitions. [2024-11-11 20:53:47,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 351 transitions. [2024-11-11 20:53:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 20:53:47,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:47,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:47,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-11 20:53:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:47,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:47,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1644734201, now seen corresponding path program 1 times [2024-11-11 20:53:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667990614] [2024-11-11 20:53:47,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:47,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:47,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:47,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-11 20:53:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:47,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:53:47,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:47,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:47,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667990614] [2024-11-11 20:53:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667990614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:47,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:47,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:53:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711821062] [2024-11-11 20:53:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:47,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:47,599 INFO L87 Difference]: Start difference. First operand 268 states and 351 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:53:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:47,711 INFO L93 Difference]: Finished difference Result 688 states and 920 transitions. [2024-11-11 20:53:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-11 20:53:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:47,720 INFO L225 Difference]: With dead ends: 688 [2024-11-11 20:53:47,720 INFO L226 Difference]: Without dead ends: 428 [2024-11-11 20:53:47,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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:53:47,722 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 41 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:47,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 349 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-11 20:53:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2024-11-11 20:53:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 317 states have (on average 1.3028391167192428) internal successors, (413), 346 states have internal predecessors, (413), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-11 20:53:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 545 transitions. [2024-11-11 20:53:47,795 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 545 transitions. Word has length 38 [2024-11-11 20:53:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:47,796 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 545 transitions. [2024-11-11 20:53:47,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 20:53:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 545 transitions. [2024-11-11 20:53:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 20:53:47,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:47,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:47,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-11 20:53:47,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:48,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:48,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:48,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1279776013, now seen corresponding path program 1 times [2024-11-11 20:53:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:48,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178204176] [2024-11-11 20:53:48,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:48,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:48,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:48,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:48,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-11 20:53:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:48,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:53:48,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:48,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:48,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:48,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178204176] [2024-11-11 20:53:48,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178204176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:48,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:48,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:48,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568317582] [2024-11-11 20:53:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:48,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:48,097 INFO L87 Difference]: Start difference. First operand 426 states and 545 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:53:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:48,157 INFO L93 Difference]: Finished difference Result 856 states and 1114 transitions. [2024-11-11 20:53:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 48 [2024-11-11 20:53:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:48,163 INFO L225 Difference]: With dead ends: 856 [2024-11-11 20:53:48,163 INFO L226 Difference]: Without dead ends: 438 [2024-11-11 20:53:48,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:48,167 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:48,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-11 20:53:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-11 20:53:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 329 states have (on average 1.2917933130699089) internal successors, (425), 358 states have internal predecessors, (425), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-11 20:53:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 557 transitions. [2024-11-11 20:53:48,226 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 557 transitions. Word has length 48 [2024-11-11 20:53:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:48,227 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 557 transitions. [2024-11-11 20:53:48,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:53:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 557 transitions. [2024-11-11 20:53:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 20:53:48,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:48,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:48,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-11 20:53:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:48,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:48,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1326247541, now seen corresponding path program 1 times [2024-11-11 20:53:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664226657] [2024-11-11 20:53:48,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:48,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:48,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:48,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-11 20:53:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:48,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:53:48,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:48,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:48,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:48,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664226657] [2024-11-11 20:53:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664226657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:48,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:53:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733238323] [2024-11-11 20:53:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 20:53:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 20:53:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 20:53:48,521 INFO L87 Difference]: Start difference. First operand 438 states and 557 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:53:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:48,562 INFO L93 Difference]: Finished difference Result 876 states and 1150 transitions. [2024-11-11 20:53:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 20:53:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 48 [2024-11-11 20:53:48,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:48,565 INFO L225 Difference]: With dead ends: 876 [2024-11-11 20:53:48,565 INFO L226 Difference]: Without dead ends: 446 [2024-11-11 20:53:48,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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:53:48,567 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:48,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-11 20:53:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-11-11 20:53:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 337 states have (on average 1.28486646884273) internal successors, (433), 366 states have internal predecessors, (433), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-11 20:53:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 565 transitions. [2024-11-11 20:53:48,598 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 565 transitions. Word has length 48 [2024-11-11 20:53:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 565 transitions. [2024-11-11 20:53:48,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:53:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 565 transitions. [2024-11-11 20:53:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 20:53:48,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:48,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:48,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-11 20:53:48,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:48,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:48,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1748949367, now seen corresponding path program 1 times [2024-11-11 20:53:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066517065] [2024-11-11 20:53:48,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:48,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:48,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:48,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:48,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-11 20:53:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:48,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:53:48,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:48,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:48,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:48,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066517065] [2024-11-11 20:53:48,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066517065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:48,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789451440] [2024-11-11 20:53:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:48,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:48,923 INFO L87 Difference]: Start difference. First operand 446 states and 565 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:53:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:48,979 INFO L93 Difference]: Finished difference Result 1070 states and 1364 transitions. [2024-11-11 20:53:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 48 [2024-11-11 20:53:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:48,985 INFO L225 Difference]: With dead ends: 1070 [2024-11-11 20:53:48,985 INFO L226 Difference]: Without dead ends: 632 [2024-11-11 20:53:48,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:48,988 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:48,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-11 20:53:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2024-11-11 20:53:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 479 states have (on average 1.2463465553235908) internal successors, (597), 512 states have internal predecessors, (597), 80 states have call successors, (80), 76 states have call predecessors, (80), 72 states have return successors, (102), 70 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-11 20:53:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 779 transitions. [2024-11-11 20:53:49,056 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 779 transitions. Word has length 48 [2024-11-11 20:53:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:49,056 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 779 transitions. [2024-11-11 20:53:49,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:53:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 779 transitions. [2024-11-11 20:53:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 20:53:49,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:49,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:49,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-11 20:53:49,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:49,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:49,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:49,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1484254575, now seen corresponding path program 1 times [2024-11-11 20:53:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983602329] [2024-11-11 20:53:49,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:49,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:49,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:49,268 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:49,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-11 20:53:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:49,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:53:49,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:49,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:49,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983602329] [2024-11-11 20:53:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983602329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:49,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682619973] [2024-11-11 20:53:49,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:49,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:49,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:49,419 INFO L87 Difference]: Start difference. First operand 632 states and 779 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 20:53:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:49,489 INFO L93 Difference]: Finished difference Result 954 states and 1197 transitions. [2024-11-11 20:53:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:49,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2024-11-11 20:53:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:49,495 INFO L225 Difference]: With dead ends: 954 [2024-11-11 20:53:49,495 INFO L226 Difference]: Without dead ends: 952 [2024-11-11 20:53:49,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:49,497 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:49,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2024-11-11 20:53:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 796. [2024-11-11 20:53:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 602 states have (on average 1.2591362126245846) internal successors, (758), 649 states have internal predecessors, (758), 101 states have call successors, (101), 95 states have call predecessors, (101), 92 states have return successors, (139), 85 states have call predecessors, (139), 101 states have call successors, (139) [2024-11-11 20:53:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 998 transitions. [2024-11-11 20:53:49,563 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 998 transitions. Word has length 52 [2024-11-11 20:53:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 998 transitions. [2024-11-11 20:53:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 20:53:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 998 transitions. [2024-11-11 20:53:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 20:53:49,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:49,569 INFO L218 NwaCegarLoop]: trace histogram [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:53:49,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-11 20:53:49,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:49,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:49,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1011032935, now seen corresponding path program 1 times [2024-11-11 20:53:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168764524] [2024-11-11 20:53:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:49,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:49,776 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:49,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-11 20:53:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:49,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:53:49,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:49,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:49,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168764524] [2024-11-11 20:53:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168764524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131590407] [2024-11-11 20:53:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:49,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:49,929 INFO L87 Difference]: Start difference. First operand 796 states and 998 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:53:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:50,016 INFO L93 Difference]: Finished difference Result 1328 states and 1687 transitions. [2024-11-11 20:53:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2024-11-11 20:53:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:50,022 INFO L225 Difference]: With dead ends: 1328 [2024-11-11 20:53:50,023 INFO L226 Difference]: Without dead ends: 925 [2024-11-11 20:53:50,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:50,024 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 55 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:50,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-11 20:53:50,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 917. [2024-11-11 20:53:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 693 states have (on average 1.2525252525252526) internal successors, (868), 746 states have internal predecessors, (868), 117 states have call successors, (117), 111 states have call predecessors, (117), 106 states have return successors, (165), 99 states have call predecessors, (165), 117 states have call successors, (165) [2024-11-11 20:53:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1150 transitions. [2024-11-11 20:53:50,117 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1150 transitions. Word has length 82 [2024-11-11 20:53:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:50,118 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1150 transitions. [2024-11-11 20:53:50,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:53:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1150 transitions. [2024-11-11 20:53:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 20:53:50,122 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:50,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:50,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-11 20:53:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:50,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:50,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1492620164, now seen corresponding path program 1 times [2024-11-11 20:53:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146878179] [2024-11-11 20:53:50,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:50,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:50,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-11 20:53:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:50,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:53:50,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:50,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:50,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146878179] [2024-11-11 20:53:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146878179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837933085] [2024-11-11 20:53:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:50,459 INFO L87 Difference]: Start difference. First operand 917 states and 1150 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:53:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:50,558 INFO L93 Difference]: Finished difference Result 1559 states and 2000 transitions. [2024-11-11 20:53:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:50,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 90 [2024-11-11 20:53:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:50,564 INFO L225 Difference]: With dead ends: 1559 [2024-11-11 20:53:50,565 INFO L226 Difference]: Without dead ends: 894 [2024-11-11 20:53:50,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:50,567 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:50,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 205 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-11 20:53:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-11-11 20:53:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 674 states have (on average 1.2195845697329377) internal successors, (822), 724 states have internal predecessors, (822), 115 states have call successors, (115), 109 states have call predecessors, (115), 104 states have return successors, (156), 98 states have call predecessors, (156), 115 states have call successors, (156) [2024-11-11 20:53:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1093 transitions. [2024-11-11 20:53:50,639 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1093 transitions. Word has length 90 [2024-11-11 20:53:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:50,640 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1093 transitions. [2024-11-11 20:53:50,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 20:53:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1093 transitions. [2024-11-11 20:53:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:53:50,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:50,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:50,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-11 20:53:50,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:50,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:50,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash 682932149, now seen corresponding path program 1 times [2024-11-11 20:53:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025649415] [2024-11-11 20:53:50,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:50,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:50,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:50,850 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:50,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-11 20:53:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:50,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 20:53:50,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:53:50,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:50,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025649415] [2024-11-11 20:53:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025649415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:50,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926144468] [2024-11-11 20:53:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:50,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:50,955 INFO L87 Difference]: Start difference. First operand 894 states and 1093 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:51,032 INFO L93 Difference]: Finished difference Result 1554 states and 1925 transitions. [2024-11-11 20:53:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-11-11 20:53:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:51,038 INFO L225 Difference]: With dead ends: 1554 [2024-11-11 20:53:51,038 INFO L226 Difference]: Without dead ends: 912 [2024-11-11 20:53:51,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:51,041 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:51,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-11-11 20:53:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2024-11-11 20:53:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 692 states have (on average 1.2138728323699421) internal successors, (840), 742 states have internal predecessors, (840), 115 states have call successors, (115), 109 states have call predecessors, (115), 104 states have return successors, (156), 98 states have call predecessors, (156), 115 states have call successors, (156) [2024-11-11 20:53:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1111 transitions. [2024-11-11 20:53:51,114 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1111 transitions. Word has length 93 [2024-11-11 20:53:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:51,114 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1111 transitions. [2024-11-11 20:53:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1111 transitions. [2024-11-11 20:53:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:53:51,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:51,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:51,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-11 20:53:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:51,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 816945655, now seen corresponding path program 1 times [2024-11-11 20:53:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672022897] [2024-11-11 20:53:51,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:51,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:51,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-11 20:53:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:51,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 20:53:51,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 20:53:51,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:53:51,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672022897] [2024-11-11 20:53:51,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672022897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:53:51,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:53:51,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-11 20:53:51,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608749597] [2024-11-11 20:53:51,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:53:51,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 20:53:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 20:53:51,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:53:51,866 INFO L87 Difference]: Start difference. First operand 912 states and 1111 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-11 20:53:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:52,314 INFO L93 Difference]: Finished difference Result 1805 states and 2248 transitions. [2024-11-11 20:53:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:53:52,314 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 93 [2024-11-11 20:53:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:52,320 INFO L225 Difference]: With dead ends: 1805 [2024-11-11 20:53:52,320 INFO L226 Difference]: Without dead ends: 1145 [2024-11-11 20:53:52,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:53:52,323 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 212 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:52,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 453 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:53:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-11 20:53:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1088. [2024-11-11 20:53:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 829 states have (on average 1.1737032569360675) internal successors, (973), 881 states have internal predecessors, (973), 125 states have call successors, (125), 121 states have call predecessors, (125), 133 states have return successors, (161), 124 states have call predecessors, (161), 125 states have call successors, (161) [2024-11-11 20:53:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1259 transitions. [2024-11-11 20:53:52,429 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1259 transitions. Word has length 93 [2024-11-11 20:53:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:52,430 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1259 transitions. [2024-11-11 20:53:52,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-11 20:53:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1259 transitions. [2024-11-11 20:53:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:53:52,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:52,433 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-11 20:53:52,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:52,634 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1340224605, now seen corresponding path program 1 times [2024-11-11 20:53:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 20:53:52,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932103950] [2024-11-11 20:53:52,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:52,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 20:53:52,639 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 20:53:52,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-11 20:53:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:52,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:53:52,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:53:52,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:52,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 20:53:52,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932103950] [2024-11-11 20:53:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932103950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:52,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756437908] [2024-11-11 20:53:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:52,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 20:53:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:52,724 INFO L87 Difference]: Start difference. First operand 1088 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:52,803 INFO L93 Difference]: Finished difference Result 1316 states and 1540 transitions. [2024-11-11 20:53:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:52,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-11 20:53:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:52,806 INFO L225 Difference]: With dead ends: 1316 [2024-11-11 20:53:52,806 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:53:52,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:52,809 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:52,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 197 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:53:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:53:52,810 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:53:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:53:52,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-11-11 20:53:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:52,811 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:53:52,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:53:52,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:53:52,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:53:52,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-11 20:53:53,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 20:53:53,017 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:53,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:53:57,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:53:57,135 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (let ((.cse0 (= (_ bv1 32) |old(~pumpRunning~0)|))) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse0 (= (_ bv1 32) ~systemActive~0)) (and .cse0 (= ~waterLevel~0 (_ bv2 32)) (not (= (_ bv0 32) ~systemActive~0))))) (= (_ bv1 32) ~pumpRunning~0)) Eliminated clause: (and (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv1 32) ~systemActive~0)) (and (= ~waterLevel~0 (_ bv2 32)) (not (= (_ bv0 32) ~systemActive~0)))) (= (_ bv1 32) ~pumpRunning~0)) [2024-11-11 20:53:57,167 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32)))) (and (or (not .cse0) (not (= (_ bv0 32) |old(~methaneLevelCritical~0)|)) (= ~methaneLevelCritical~0 (_ bv0 32))) (let ((.cse1 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~systemActive~0)) (.cse2 (= (_ bv0 32) ~pumpRunning~0)) (.cse5 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse1 .cse2 .cse0 .cse3) (and .cse1 .cse2 .cse4 .cse0) (and .cse2 .cse4 .cse5 .cse0) (and .cse5 (= (_ bv1 32) ~pumpRunning~0) .cse3) (and .cse2 .cse5 .cse0 .cse3))))) Eliminated clause: (let ((.cse0 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~systemActive~0)) (.cse1 (= (_ bv0 32) ~pumpRunning~0)) (.cse5 (= ~waterLevel~0 (_ bv2 32))) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse4 .cse5 .cse2) (and .cse5 (= (_ bv1 32) ~pumpRunning~0) .cse3) (and .cse1 .cse5 .cse2 .cse3))) [2024-11-11 20:53:57,214 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse11 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse13 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse12 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse10 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse10)) (.cse0 (not .cse12)) (.cse6 (not .cse13)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse5 (not .cse11)) (.cse4 (= ~waterLevel~0 (_ bv2 32))) (.cse8 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|)) (.cse7 (= (_ bv1 32) ~systemActive~0))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4) .cse5 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse3) .cse6) (or .cse0 .cse6 .cse1) (or (and .cse3 .cse4 .cse1) (not .cse7) (not .cse8) .cse5) (or (and .cse4 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9)) (or (and .cse10 .cse8 .cse11) (and .cse12 .cse8 .cse13 .cse7) (and .cse10 .cse8 .cse13 (= ~methaneLevelCritical~0 (_ bv0 32))) (and .cse12 .cse8 .cse11 .cse7) (and .cse12 .cse10 .cse8 .cse13) (and .cse9 .cse11 .cse7))))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32)) (|old(~methAndRunningLastTime~0)| (_ BitVec 32)) (|old(~pumpRunning~0)| (_ BitVec 32))) (let ((.cse11 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse13 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse12 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse10 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse10)) (.cse0 (not .cse12)) (.cse6 (not .cse13)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse5 (not .cse11)) (.cse4 (= ~waterLevel~0 (_ bv2 32))) (.cse8 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|)) (.cse7 (= (_ bv1 32) ~systemActive~0))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4) .cse5 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse3) .cse6) (or .cse0 .cse6 .cse1) (or (and .cse3 .cse4 .cse1) (not .cse7) (not .cse8) .cse5) (or (and .cse4 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9)) (or (and .cse10 .cse8 .cse11) (and .cse12 .cse8 .cse13 .cse7) (and .cse10 .cse8 .cse13 (= ~methaneLevelCritical~0 (_ bv0 32))) (and .cse12 .cse8 .cse11 .cse7) (and .cse12 .cse10 .cse8 .cse13) (and .cse9 .cse11 .cse7)))))) [2024-11-11 20:53:57,234 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:53:57,246 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse1 (= ~waterLevel~0 (_ bv2 32))) (.cse4 (= ~methaneLevelCritical~0 (_ bv0 32))) (.cse5 (= ~waterLevel~0 (_ bv1 32))) (.cse0 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse5 .cse0 .cse4 .cse3) (and .cse5 .cse0 .cse2 .cse3)))) Eliminated clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse1 (= ~methaneLevelCritical~0 (_ bv0 32))) (.cse3 (= ~waterLevel~0 (_ bv2 32))) (.cse0 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse4 .cse2)))) [2024-11-11 20:53:57,262 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse0 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (or (= ~waterLevel~0 (_ bv1 32)) (not .cse0)) (let ((.cse5 (= (_ bv0 32) ~systemActive~0)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and (= (_ bv1 32) ~pumpRunning~0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse3 .cse5 .cse0 .cse4) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2))) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse1)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32))) (let ((.cse0 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (or (= ~waterLevel~0 (_ bv1 32)) (not .cse0)) (let ((.cse5 (= (_ bv0 32) ~systemActive~0)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and (= (_ bv1 32) ~pumpRunning~0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse3 .cse5 .cse0 .cse4) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2))) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse1))))) [2024-11-11 20:53:57,272 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:53:57,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:53:57 BoogieIcfgContainer [2024-11-11 20:53:57,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:53:57,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:53:57,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:53:57,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:53:57,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:45" (3/4) ... [2024-11-11 20:53:57,280 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:53:57,284 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:57,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:53:57,293 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 20:53:57,293 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:53:57,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:53:57,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:57,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:57,413 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:53:57,413 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:53:57,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:53:57,414 INFO L158 Benchmark]: Toolchain (without parser) took 13188.62ms. Allocated memory was 60.8MB in the beginning and 207.6MB in the end (delta: 146.8MB). Free memory was 27.5MB in the beginning and 106.6MB in the end (delta: -79.1MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,414 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 46.1MB. Free memory was 27.1MB in the beginning and 27.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:53:57,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.07ms. Allocated memory is still 60.8MB. Free memory was 27.3MB in the beginning and 38.7MB in the end (delta: -11.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.26ms. Allocated memory is still 60.8MB. Free memory was 38.7MB in the beginning and 36.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,415 INFO L158 Benchmark]: Boogie Preprocessor took 63.08ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 33.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,415 INFO L158 Benchmark]: RCFGBuilder took 497.33ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 33.9MB in the beginning and 44.8MB in the end (delta: -10.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,415 INFO L158 Benchmark]: TraceAbstraction took 11863.10ms. Allocated memory was 73.4MB in the beginning and 207.6MB in the end (delta: 134.2MB). Free memory was 44.0MB in the beginning and 115.0MB in the end (delta: -71.0MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,415 INFO L158 Benchmark]: Witness Printer took 139.96ms. Allocated memory is still 207.6MB. Free memory was 115.0MB in the beginning and 106.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:57,417 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.90ms. Allocated memory is still 46.1MB. Free memory was 27.1MB in the beginning and 27.1MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.07ms. Allocated memory is still 60.8MB. Free memory was 27.3MB in the beginning and 38.7MB in the end (delta: -11.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.26ms. Allocated memory is still 60.8MB. Free memory was 38.7MB in the beginning and 36.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.08ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 33.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.33ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 33.9MB in the beginning and 44.8MB in the end (delta: -10.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11863.10ms. Allocated memory was 73.4MB in the beginning and 207.6MB in the end (delta: 134.2MB). Free memory was 44.0MB in the beginning and 115.0MB in the end (delta: -71.0MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. * Witness Printer took 139.96ms. Allocated memory is still 207.6MB. Free memory was 115.0MB in the beginning and 106.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [343] - GenericResultAtLocation [Line: 383]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [383] - GenericResultAtLocation [Line: 421]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [421] - GenericResultAtLocation [Line: 525]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [525] - GenericResultAtLocation [Line: 622]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [622] - GenericResultAtLocation [Line: 631]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [631] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 627]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 630 mSDsluCounter, 3701 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2235 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 1466 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1088occurred in iteration=13, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 226 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 883 ConstructedInterpolants, 0 QuantifiedInterpolants, 1739 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1793 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 159/172 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: 65]: Loop Invariant Derived loop invariant: ((((((((waterLevel == 2) && (1 == pumpRunning)) && (0 == splverifierCounter)) && (1 == systemActive)) || (((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter))) || (((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) || (((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter))) || (((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 226]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((waterLevel == 1) && (1 == systemActive)) || ((waterLevel == 2) && (0 != systemActive))) && (1 == pumpRunning)) Ensures: (((0 == pumpRunning) && ((((waterLevel == 1) && (1 == \old(pumpRunning))) && (1 == systemActive)) || (((1 == \old(pumpRunning)) && (waterLevel == 2)) && (0 != systemActive)))) && ((((((systemActive == \old(systemActive)) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 159]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((((waterLevel == 1) && (0 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 449]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (((waterLevel == 2) && (1 == pumpRunning)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: (((((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (((waterLevel == 2) && (1 == pumpRunning)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 461]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) || (((0 == pumpRunning) && (waterLevel == 2)) && (1 == systemActive))) || (((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive))) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == pumpRunning)) && (1 == systemActive))) || (((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2))) || ((((waterLevel == 2) && (1 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) || (((0 == pumpRunning) && (waterLevel == 2)) && (1 == systemActive))) || (((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive))) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == pumpRunning)) && (1 == systemActive))) || (((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2))) || ((((waterLevel == 2) && (1 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && ((methaneLevelCritical != 0) || (0 == \result))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 527]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 135]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((1 != \old(waterLevel)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0))) && ((methaneLevelCritical != 0) || (methAndRunningLastTime == 0))) && (((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) || (2 != \old(waterLevel))) || (0 != systemActive))) && ((1 != \old(pumpRunning)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)))) && (((((waterLevel == 2) && (1 == pumpRunning)) || (((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (0 != \old(pumpRunning))) || (2 != \old(waterLevel)))) && ((((((((0 == systemActive) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel))) && (1 == systemActive))) || ((((0 == systemActive) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel))) && (methaneLevelCritical == 0))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) && (1 == systemActive))) || ((((0 == \old(methAndRunningLastTime)) && (0 == systemActive)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel)))) || (((1 == \old(pumpRunning)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && ((((systemActive == \old(systemActive)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 167]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((0 == pumpRunning) && ((((((waterLevel == 1) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((waterLevel == 2) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 1) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) Ensures: ((((((((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((0 == pumpRunning) || (waterLevel != 1))) && ((0 == pumpRunning) || (1 == pumpRunning))) && ((((((systemActive == \old(systemActive)) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) - ProcedureContractResult [Line: 437]: Procedure Contract for waterRise Derived contract for procedure waterRise. Ensures: (((waterLevel == 2) && (((((((1 == pumpRunning) && (2 == \old(waterLevel))) && (1 == systemActive)) || ((((0 == pumpRunning) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (0 == systemActive)) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (methAndRunningLastTime == 0)) && (2 == \old(waterLevel)))) || ((((0 == pumpRunning) && (methAndRunningLastTime == 0)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:53:57,453 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