./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product58.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 5ed8e4dea18b15d78522f05bcbacefb8bf743c0552ef5a7415602905a04fdc4c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:07:37,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:07:37,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:07:37,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:07:37,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:07:37,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:07:37,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:07:37,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:07:37,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:07:37,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:07:37,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:07:37,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:07:37,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:07:37,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:07:37,281 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:07:37,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:07:37,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:07:37,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:07:37,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:07:37,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:07:37,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:07:37,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:07:37,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:07:37,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:07:37,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:07:37,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:07:37,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:07:37,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:07:37,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:07:37,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:07:37,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:07:37,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:07:37,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:07:37,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:07:37,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:07:37,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:07:37,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:07:37,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:07:37,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:07:37,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:07:37,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:07:37,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:07:37,293 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 -> 5ed8e4dea18b15d78522f05bcbacefb8bf743c0552ef5a7415602905a04fdc4c [2024-10-14 03:07:37,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:07:37,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:07:37,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:07:37,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:07:37,492 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:07:37,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c [2024-10-14 03:07:38,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:07:39,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:07:39,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product58.cil.c [2024-10-14 03:07:39,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd6594d2/3f7d0eef69dd452d9be9ccddc3284dd7/FLAG9c0bb460e [2024-10-14 03:07:39,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd6594d2/3f7d0eef69dd452d9be9ccddc3284dd7 [2024-10-14 03:07:39,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:07:39,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:07:39,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:07:39,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:07:39,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:07:39,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9d6dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39, skipping insertion in model container [2024-10-14 03:07:39,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:07:39,389 WARN L248 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_spec1_product58.cil.c[1605,1618] [2024-10-14 03:07:39,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:07:39,580 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:07:39,612 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-10-14 03:07:39,614 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [58] [2024-10-14 03:07:39,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2024-10-14 03:07:39,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [271] [2024-10-14 03:07:39,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [499] [2024-10-14 03:07:39,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [525] [2024-10-14 03:07:39,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [592] [2024-10-14 03:07:39,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [627] [2024-10-14 03:07:39,618 WARN L248 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_spec1_product58.cil.c[1605,1618] [2024-10-14 03:07:39,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:07:39,700 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:07:39,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39 WrapperNode [2024-10-14 03:07:39,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:07:39,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:07:39,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:07:39,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:07:39,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,733 INFO L138 Inliner]: procedures = 57, calls = 101, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 218 [2024-10-14 03:07:39,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:07:39,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:07:39,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:07:39,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:07:39,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,762 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-10-14 03:07:39,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:07:39,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:07:39,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:07:39,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:07:39,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (1/1) ... [2024-10-14 03:07:39,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:07:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:07:39,829 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-10-14 03:07:39,834 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-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:07:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:07:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:07:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-14 03:07:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:07:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:07:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:07:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:07:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:07:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:07:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:07:39,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:07:39,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:07:39,927 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:07:39,928 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:07:40,128 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-14 03:07:40,129 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:07:40,178 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:07:40,178 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:07:40,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:07:40 BoogieIcfgContainer [2024-10-14 03:07:40,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:07:40,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:07:40,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:07:40,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:07:40,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:07:39" (1/3) ... [2024-10-14 03:07:40,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed1c83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:07:40, skipping insertion in model container [2024-10-14 03:07:40,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:07:39" (2/3) ... [2024-10-14 03:07:40,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed1c83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:07:40, skipping insertion in model container [2024-10-14 03:07:40,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:07:40" (3/3) ... [2024-10-14 03:07:40,185 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product58.cil.c [2024-10-14 03:07:40,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:07:40,198 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:07:40,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:07:40,286 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;@52dcc24b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:07:40,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:07:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.54) internal successors, (77), 58 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 03:07:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:07:40,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:40,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:40,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:40,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1578107500, now seen corresponding path program 1 times [2024-10-14 03:07:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752871738] [2024-10-14 03:07:40,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:40,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:07:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752871738] [2024-10-14 03:07:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752871738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:07:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415378296] [2024-10-14 03:07:40,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:40,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:07:40,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:40,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:07:40,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:07:40,508 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.54) internal successors, (77), 58 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-14 03:07:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:40,565 INFO L93 Difference]: Finished difference Result 140 states and 203 transitions. [2024-10-14 03:07:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:07:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2024-10-14 03:07:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:40,574 INFO L225 Difference]: With dead ends: 140 [2024-10-14 03:07:40,574 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 03:07:40,577 INFO L431 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-10-14 03:07:40,579 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:40,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 03:07:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 03:07:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.425531914893617) internal successors, (67), 54 states have internal predecessors, (67), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 03:07:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-10-14 03:07:40,616 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 16 [2024-10-14 03:07:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:40,617 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-10-14 03:07:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-10-14 03:07:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-10-14 03:07:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 03:07:40,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:40,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:07:40,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -728475820, now seen corresponding path program 1 times [2024-10-14 03:07:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509563705] [2024-10-14 03:07:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:07:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:40,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:40,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509563705] [2024-10-14 03:07:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509563705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:40,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:07:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677153891] [2024-10-14 03:07:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:40,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:07:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:40,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:07:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:40,709 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 03:07:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:40,750 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2024-10-14 03:07:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:07:40,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2024-10-14 03:07:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:40,753 INFO L225 Difference]: With dead ends: 105 [2024-10-14 03:07:40,753 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 03:07:40,753 INFO L431 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-10-14 03:07:40,754 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:40,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 03:07:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 03:07:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 49 states have internal predecessors, (61), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:07:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2024-10-14 03:07:40,768 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 17 [2024-10-14 03:07:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:40,768 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2024-10-14 03:07:40,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 03:07:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-10-14 03:07:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 03:07:40,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:40,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:40,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:07:40,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:40,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:40,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1880637593, now seen corresponding path program 1 times [2024-10-14 03:07:40,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:40,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532261523] [2024-10-14 03:07:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532261523] [2024-10-14 03:07:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532261523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:40,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:07:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134966712] [2024-10-14 03:07:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:40,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:07:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:07:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:40,838 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10-14 03:07:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:40,887 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2024-10-14 03:07:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:07:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2024-10-14 03:07:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:40,888 INFO L225 Difference]: With dead ends: 114 [2024-10-14 03:07:40,888 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 03:07:40,889 INFO L431 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-10-14 03:07:40,889 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:40,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 03:07:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-14 03:07:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:07:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-10-14 03:07:40,897 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 20 [2024-10-14 03:07:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:40,898 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-10-14 03:07:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10-14 03:07:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-10-14 03:07:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 03:07:40,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:40,899 INFO L215 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-10-14 03:07:40,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:07:40,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:40,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1083229865, now seen corresponding path program 1 times [2024-10-14 03:07:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:40,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825746886] [2024-10-14 03:07:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:07:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:40,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825746886] [2024-10-14 03:07:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825746886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:40,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:40,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:07:40,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012666659] [2024-10-14 03:07:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:40,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:07:40,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:07:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:07:40,983 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-14 03:07:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:41,069 INFO L93 Difference]: Finished difference Result 153 states and 208 transitions. [2024-10-14 03:07:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:07:41,069 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), 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 25 [2024-10-14 03:07:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:41,070 INFO L225 Difference]: With dead ends: 153 [2024-10-14 03:07:41,070 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 03:07:41,071 INFO L431 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-10-14 03:07:41,072 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:41,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 117 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 03:07:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-10-14 03:07:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 77 states have internal predecessors, (95), 13 states have call successors, (13), 12 states have call predecessors, (13), 12 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-14 03:07:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-10-14 03:07:41,087 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 25 [2024-10-14 03:07:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:41,088 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-10-14 03:07:41,088 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), 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-10-14 03:07:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-10-14 03:07:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:07:41,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:41,089 INFO L215 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] [2024-10-14 03:07:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:07:41,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -261711306, now seen corresponding path program 1 times [2024-10-14 03:07:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336666710] [2024-10-14 03:07:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:07:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336666710] [2024-10-14 03:07:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336666710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:41,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:07:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573864435] [2024-10-14 03:07:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:41,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:41,196 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:07:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:41,380 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2024-10-14 03:07:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:07:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-14 03:07:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:41,381 INFO L225 Difference]: With dead ends: 117 [2024-10-14 03:07:41,382 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 03:07:41,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:07:41,383 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 97 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:41,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 160 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 03:07:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-10-14 03:07:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 90 states have internal predecessors, (110), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-10-14 03:07:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2024-10-14 03:07:41,403 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 35 [2024-10-14 03:07:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:41,405 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2024-10-14 03:07:41,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:07:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2024-10-14 03:07:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:07:41,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:41,406 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:07:41,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:07:41,406 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:41,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash 106988549, now seen corresponding path program 1 times [2024-10-14 03:07:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:41,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384760216] [2024-10-14 03:07:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:41,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:07:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:07:41,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384760216] [2024-10-14 03:07:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384760216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:41,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:41,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:07:41,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473154581] [2024-10-14 03:07:41,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:41,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:41,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:41,512 INFO L87 Difference]: Start difference. First operand 113 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:07:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:41,625 INFO L93 Difference]: Finished difference Result 228 states and 304 transitions. [2024-10-14 03:07:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:07:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 03:07:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:41,626 INFO L225 Difference]: With dead ends: 228 [2024-10-14 03:07:41,626 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 03:07:41,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-10-14 03:07:41,630 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:41,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 169 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 03:07:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-10-14 03:07:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 92 states have internal predecessors, (112), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-10-14 03:07:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2024-10-14 03:07:41,649 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 38 [2024-10-14 03:07:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:41,650 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2024-10-14 03:07:41,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:07:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2024-10-14 03:07:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:07:41,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:41,655 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:07:41,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:07:41,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash -710659901, now seen corresponding path program 1 times [2024-10-14 03:07:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:41,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407637484] [2024-10-14 03:07:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:07:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:07:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:41,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407637484] [2024-10-14 03:07:41,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407637484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:41,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:41,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:07:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224187263] [2024-10-14 03:07:41,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:41,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:07:41,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:07:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:07:41,721 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:07:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:41,860 INFO L93 Difference]: Finished difference Result 232 states and 308 transitions. [2024-10-14 03:07:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:07:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-14 03:07:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:41,861 INFO L225 Difference]: With dead ends: 232 [2024-10-14 03:07:41,861 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 03:07:41,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:07:41,863 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 115 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:41,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 164 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 03:07:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-14 03:07:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 94 states have internal predecessors, (114), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-10-14 03:07:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2024-10-14 03:07:41,872 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 38 [2024-10-14 03:07:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:41,872 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2024-10-14 03:07:41,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 03:07:41,872 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2024-10-14 03:07:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:07:41,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:41,873 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:07:41,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:07:41,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:41,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash -491805183, now seen corresponding path program 1 times [2024-10-14 03:07:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:41,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585414296] [2024-10-14 03:07:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:41,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:07:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:07:41,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:41,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585414296] [2024-10-14 03:07:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585414296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:07:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337238950] [2024-10-14 03:07:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:07:41,927 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:07:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:42,145 INFO L93 Difference]: Finished difference Result 371 states and 515 transitions. [2024-10-14 03:07:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:07:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-14 03:07:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:42,147 INFO L225 Difference]: With dead ends: 371 [2024-10-14 03:07:42,147 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 03:07:42,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-10-14 03:07:42,148 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 169 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:42,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 222 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:07:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 03:07:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2024-10-14 03:07:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 184 states have (on average 1.3206521739130435) internal successors, (243), 197 states have internal predecessors, (243), 35 states have call successors, (35), 33 states have call predecessors, (35), 32 states have return successors, (59), 33 states have call predecessors, (59), 35 states have call successors, (59) [2024-10-14 03:07:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 337 transitions. [2024-10-14 03:07:42,176 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 337 transitions. Word has length 38 [2024-10-14 03:07:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:42,176 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 337 transitions. [2024-10-14 03:07:42,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:07:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 337 transitions. [2024-10-14 03:07:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 03:07:42,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:42,177 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:07:42,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:07:42,178 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:42,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:42,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1405164633, now seen corresponding path program 1 times [2024-10-14 03:07:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:42,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988948756] [2024-10-14 03:07:42,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:42,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:42,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:07:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:42,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:07:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:42,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:07:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:07:42,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:42,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988948756] [2024-10-14 03:07:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988948756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:42,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:07:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:07:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483610680] [2024-10-14 03:07:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:42,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:07:42,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:42,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:07:42,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:07:42,306 INFO L87 Difference]: Start difference. First operand 252 states and 337 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:07:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:42,945 INFO L93 Difference]: Finished difference Result 842 states and 1171 transitions. [2024-10-14 03:07:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:07:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-14 03:07:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:42,950 INFO L225 Difference]: With dead ends: 842 [2024-10-14 03:07:42,950 INFO L226 Difference]: Without dead ends: 592 [2024-10-14 03:07:42,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:07:42,961 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 248 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:42,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 214 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:07:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-14 03:07:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 586. [2024-10-14 03:07:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 425 states have (on average 1.2705882352941176) internal successors, (540), 458 states have internal predecessors, (540), 86 states have call successors, (86), 66 states have call predecessors, (86), 74 states have return successors, (162), 84 states have call predecessors, (162), 86 states have call successors, (162) [2024-10-14 03:07:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 788 transitions. [2024-10-14 03:07:43,036 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 788 transitions. Word has length 42 [2024-10-14 03:07:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:43,037 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 788 transitions. [2024-10-14 03:07:43,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 03:07:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 788 transitions. [2024-10-14 03:07:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 03:07:43,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:43,038 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:07:43,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:07:43,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:43,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1181880981, now seen corresponding path program 1 times [2024-10-14 03:07:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:43,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177666045] [2024-10-14 03:07:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:07:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:07:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:07:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:07:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:07:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177666045] [2024-10-14 03:07:43,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177666045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:07:43,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692774453] [2024-10-14 03:07:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:43,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:07:43,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:07:43,199 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-10-14 03:07:43,200 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-10-14 03:07:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:07:43,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:07:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:07:43,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:07:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692774453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:07:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-14 03:07:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607049766] [2024-10-14 03:07:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:43,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:07:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:07:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:07:43,393 INFO L87 Difference]: Start difference. First operand 586 states and 788 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 03:07:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:43,519 INFO L93 Difference]: Finished difference Result 1144 states and 1544 transitions. [2024-10-14 03:07:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:07:43,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2024-10-14 03:07:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:43,524 INFO L225 Difference]: With dead ends: 1144 [2024-10-14 03:07:43,524 INFO L226 Difference]: Without dead ends: 560 [2024-10-14 03:07:43,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:07:43,527 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 52 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:43,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 311 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-14 03:07:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-10-14 03:07:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 406 states have (on average 1.2536945812807883) internal successors, (509), 438 states have internal predecessors, (509), 83 states have call successors, (83), 64 states have call predecessors, (83), 70 states have return successors, (143), 79 states have call predecessors, (143), 83 states have call successors, (143) [2024-10-14 03:07:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2024-10-14 03:07:43,565 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 46 [2024-10-14 03:07:43,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:43,565 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2024-10-14 03:07:43,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 03:07:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2024-10-14 03:07:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:07:43,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:43,567 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 03:07:43,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:07:43,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 03:07:43,772 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash -801837340, now seen corresponding path program 1 times [2024-10-14 03:07:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752003537] [2024-10-14 03:07:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:07:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:07:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:07:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:07:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:07:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:07:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 03:07:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:07:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752003537] [2024-10-14 03:07:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752003537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:07:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487924676] [2024-10-14 03:07:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:07:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:07:43,931 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-10-14 03:07:43,932 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-10-14 03:07:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:43,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 03:07:43,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:07:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:07:44,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:07:44,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487924676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:44,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:07:44,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2024-10-14 03:07:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432783011] [2024-10-14 03:07:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:44,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:07:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:44,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:07:44,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:07:44,058 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 03:07:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:44,172 INFO L93 Difference]: Finished difference Result 1428 states and 1930 transitions. [2024-10-14 03:07:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:07:44,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-10-14 03:07:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:44,176 INFO L225 Difference]: With dead ends: 1428 [2024-10-14 03:07:44,177 INFO L226 Difference]: Without dead ends: 870 [2024-10-14 03:07:44,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:07:44,179 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 86 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:44,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 289 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:07:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2024-10-14 03:07:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 810. [2024-10-14 03:07:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 586 states have (on average 1.2491467576791808) internal successors, (732), 630 states have internal predecessors, (732), 121 states have call successors, (121), 98 states have call predecessors, (121), 102 states have return successors, (211), 109 states have call predecessors, (211), 121 states have call successors, (211) [2024-10-14 03:07:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1064 transitions. [2024-10-14 03:07:44,263 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1064 transitions. Word has length 79 [2024-10-14 03:07:44,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:44,263 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1064 transitions. [2024-10-14 03:07:44,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 03:07:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1064 transitions. [2024-10-14 03:07:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:07:44,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:07:44,264 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-14 03:07:44,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:07:44,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 03:07:44,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:07:44,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:07:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1619485790, now seen corresponding path program 1 times [2024-10-14 03:07:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:07:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058614840] [2024-10-14 03:07:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:07:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:07:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:07:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:07:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:07:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:07:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:07:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:07:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:07:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 03:07:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 03:07:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:07:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058614840] [2024-10-14 03:07:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058614840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:07:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503536607] [2024-10-14 03:07:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:07:44,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:07:44,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:07:44,545 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-10-14 03:07:44,546 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-10-14 03:07:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:07:44,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:07:44,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:07:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:07:44,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:07:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503536607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:07:44,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:07:44,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-14 03:07:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371839475] [2024-10-14 03:07:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:07:44,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:07:44,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:07:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:07:44,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:07:44,622 INFO L87 Difference]: Start difference. First operand 810 states and 1064 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 03:07:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:07:44,658 INFO L93 Difference]: Finished difference Result 1143 states and 1483 transitions. [2024-10-14 03:07:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:07:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2024-10-14 03:07:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:07:44,660 INFO L225 Difference]: With dead ends: 1143 [2024-10-14 03:07:44,660 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:07:44,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:07:44,662 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:07:44,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:07:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:07:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:07:44,663 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-10-14 03:07:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:07:44,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-10-14 03:07:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:07:44,664 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:07:44,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 03:07:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:07:44,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:07:44,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:07:44,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:07:44,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:07:44,869 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:07:44,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 03:07:47,012 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:07:47,050 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse3 (= |old(~methaneLevelCritical~0)| 0))) (and (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 (<= 1 |old(~methaneLevelCritical~0)|) .cse1 .cse2) (and .cse3 (<= 2 ~waterLevel~0) .cse1) (and .cse0 .cse3 .cse1 .cse2))) (or (<= 1 ~methaneLevelCritical~0) (< |old(~methaneLevelCritical~0)| 1)) (or (not .cse3) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse3 (= |old(~methaneLevelCritical~0)| 0))) (and (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 (<= 1 |old(~methaneLevelCritical~0)|) .cse1 .cse2) (and .cse3 (<= 2 ~waterLevel~0) .cse1) (and .cse0 .cse3 .cse1 .cse2))) (or (< |old(~methaneLevelCritical~0)| 1) (< 0 ~methaneLevelCritical~0)) (or (not .cse3) (= ~methaneLevelCritical~0 0))))) [2024-10-14 03:07:47,058 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 03:07:47,069 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse3 (<= 1 |old(~waterLevel~0)|)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse5 (<= 2 |old(~waterLevel~0)|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse1 .cse5))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse4 (<= 1 ~methaneLevelCritical~0)) (.cse1 (<= 2 ~waterLevel~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse5 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse4 .cse1 .cse2) (and .cse3 .cse0 .cse2 .cse5))) [2024-10-14 03:07:47,086 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= |old(~pumpRunning~0)| 0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1 .cse2) (and (= ~methaneLevelCritical~0 0) .cse0 .cse1 .cse2)))) Eliminated clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= 1 ~waterLevel~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0 .cse1) (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1)))) [2024-10-14 03:07:47,093 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse2 (<= 1 |old(~waterLevel~0)|)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0))) (or (and .cse0 (<= 1 ~methaneLevelCritical~0) .cse1 .cse2) (and .cse0 .cse3 .cse1 .cse2) (and .cse3 .cse1 (<= 2 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse2 (= ~pumpRunning~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (<= 1 ~waterLevel~0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1) (and .cse2 (<= 1 ~methaneLevelCritical~0) .cse1 .cse3) (and .cse2 .cse0 .cse1 .cse3))) [2024-10-14 03:07:47,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:07:47 BoogieIcfgContainer [2024-10-14 03:07:47,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:07:47,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:07:47,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:07:47,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:07:47,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:07:40" (3/4) ... [2024-10-14 03:07:47,106 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:07:47,109 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-14 03:07:47,116 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-14 03:07:47,117 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-14 03:07:47,117 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 03:07:47,117 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:07:47,118 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 03:07:47,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:07:47,208 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 03:07:47,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:07:47,209 INFO L158 Benchmark]: Toolchain (without parser) took 8014.47ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 104.6MB in the beginning and 203.0MB in the end (delta: -98.4MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,209 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:07:47,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.56ms. Allocated memory is still 172.0MB. Free memory was 104.3MB in the beginning and 138.8MB in the end (delta: -34.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.05ms. Allocated memory is still 172.0MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,210 INFO L158 Benchmark]: Boogie Preprocessor took 55.86ms. Allocated memory is still 172.0MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,210 INFO L158 Benchmark]: RCFGBuilder took 388.29ms. Allocated memory is still 172.0MB. Free memory was 133.9MB in the beginning and 109.4MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,210 INFO L158 Benchmark]: TraceAbstraction took 6923.20ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 108.7MB in the beginning and 211.4MB in the end (delta: -102.7MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,210 INFO L158 Benchmark]: Witness Printer took 104.49ms. Allocated memory is still 293.6MB. Free memory was 211.4MB in the beginning and 203.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 03:07:47,211 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.08ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.56ms. Allocated memory is still 172.0MB. Free memory was 104.3MB in the beginning and 138.8MB in the end (delta: -34.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.05ms. Allocated memory is still 172.0MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.86ms. Allocated memory is still 172.0MB. Free memory was 136.0MB in the beginning and 133.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.29ms. Allocated memory is still 172.0MB. Free memory was 133.9MB in the beginning and 109.4MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6923.20ms. Allocated memory was 172.0MB in the beginning and 293.6MB in the end (delta: 121.6MB). Free memory was 108.7MB in the beginning and 211.4MB in the end (delta: -102.7MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. * Witness Printer took 104.49ms. Allocated memory is still 293.6MB. Free memory was 211.4MB in the beginning and 203.0MB 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,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [58] - GenericResultAtLocation [Line: 169]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] - GenericResultAtLocation [Line: 271]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [271] - GenericResultAtLocation [Line: 499]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [499] - GenericResultAtLocation [Line: 525]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [525] - GenericResultAtLocation [Line: 592]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [592] - GenericResultAtLocation [Line: 627]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [627] - 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: 54]: 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 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 950 mSDsluCounter, 2071 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1226 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 845 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=11, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 78 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 677 NumberOfCodeBlocks, 677 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 1142 SizeOfPredicates, 2 NumberOfNonLiveVariables, 763 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 111/116 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: 535]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel)) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) - ProcedureContractResult [Line: 304]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) - ProcedureContractResult [Line: 93]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: ((((((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive)) && (1 <= waterLevel)) || (((\old(methaneLevelCritical) == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) && (1 <= waterLevel))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 280]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1))) && ((methaneLevelCritical < 1) || ((pumpRunning == 0) && (1 <= waterLevel)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) && ((((((1 <= methaneLevelCritical) && (1 == systemActive)) && (\old(pumpRunning) == 0)) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) - ProcedureContractResult [Line: 172]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 105]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((\result == methaneLevelCritical) && (((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel)))) - ProcedureContractResult [Line: 312]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((pumpRunning == 0) && ((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= waterLevel)))) Ensures: ((((((pumpRunning == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)) || (methaneLevelCritical < 1)) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((0 < methaneLevelCritical) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) - ProcedureContractResult [Line: 81]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (2 <= waterLevel)) && (1 == systemActive)) && ((pumpRunning == 0) || (methaneLevelCritical < 1))) && (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= \old(waterLevel))) || ((methaneLevelCritical == 0) && (2 <= \old(waterLevel)))) || ((1 <= methaneLevelCritical) && (1 <= \old(waterLevel))))) RESULT: Ultimate proved your program to be correct! [2024-10-14 03:07:47,233 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