./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_spec4_product61.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product61.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a5340faf3ec1f0e0bc66d280fc3b45c510e704ff1d108d74101ee8606e665888 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:00:40,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:00:40,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:00:40,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:00:40,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:00:40,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:00:40,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:00:40,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:00:40,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:00:40,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:00:40,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:00:40,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:00:40,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:00:40,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:00:40,140 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:00:40,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:00:40,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:00:40,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:00:40,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:00:40,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:00:40,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:00:40,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:00:40,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:00:40,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:00:40,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:00:40,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:00:40,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:00:40,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:00:40,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:00:40,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:00:40,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:00:40,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:00:40,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:40,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:00:40,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:00:40,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:00:40,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:00:40,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:00:40,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:00:40,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:00:40,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:00:40,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:00:40,151 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-clean/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-clean/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 -> a5340faf3ec1f0e0bc66d280fc3b45c510e704ff1d108d74101ee8606e665888 [2024-10-11 03:00:40,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:00:40,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:00:40,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:00:40,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:00:40,447 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:00:40,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product61.cil.c [2024-10-11 03:00:41,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:00:42,131 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:00:42,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product61.cil.c [2024-10-11 03:00:42,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21e3e9fc0/283dc55e56044f1abe3747c629e3e46b/FLAG0e6c428e4 [2024-10-11 03:00:42,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21e3e9fc0/283dc55e56044f1abe3747c629e3e46b [2024-10-11 03:00:42,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:00:42,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:00:42,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:42,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:00:42,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:00:42,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd9de03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42, skipping insertion in model container [2024-10-11 03:00:42,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:00:42,424 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_spec4_product61.cil.c[1605,1618] [2024-10-11 03:00:42,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:42,570 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:00:42,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-10-11 03:00:42,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [58] [2024-10-11 03:00:42,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [96] [2024-10-11 03:00:42,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [347] [2024-10-11 03:00:42,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [415] [2024-10-11 03:00:42,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [519] [2024-10-11 03:00:42,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [545] [2024-10-11 03:00:42,584 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [911] [2024-10-11 03:00:42,588 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_spec4_product61.cil.c[1605,1618] [2024-10-11 03:00:42,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:42,678 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:00:42,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42 WrapperNode [2024-10-11 03:00:42,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:42,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:42,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:00:42,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:00:42,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,738 INFO L138 Inliner]: procedures = 57, calls = 104, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 236 [2024-10-11 03:00:42,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:42,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:00:42,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:00:42,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:00:42,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,769 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-11 03:00:42,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:00:42,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:00:42,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:00:42,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:00:42,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (1/1) ... [2024-10-11 03:00:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:42,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:00:42,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:00:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 03:00:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 03:00:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 03:00:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 03:00:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 03:00:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 03:00:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:42,910 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 03:00:42,911 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 03:00:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-10-11 03:00:42,911 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-10-11 03:00:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-10-11 03:00:42,912 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-10-11 03:00:42,912 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 03:00:42,912 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 03:00:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:00:42,913 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 03:00:42,913 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 03:00:42,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:00:42,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:00:43,028 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:00:43,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:00:43,395 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-11 03:00:43,395 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:00:43,464 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:00:43,467 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:00:43,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:43 BoogieIcfgContainer [2024-10-11 03:00:43,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:00:43,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:00:43,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:00:43,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:00:43,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:00:42" (1/3) ... [2024-10-11 03:00:43,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca11d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:43, skipping insertion in model container [2024-10-11 03:00:43,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:42" (2/3) ... [2024-10-11 03:00:43,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca11d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:43, skipping insertion in model container [2024-10-11 03:00:43,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:43" (3/3) ... [2024-10-11 03:00:43,478 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product61.cil.c [2024-10-11 03:00:43,494 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:00:43,495 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:00:43,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:00:43,564 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;@3a5623b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:00:43,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:00:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 65 states have internal predecessors, (84), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 03:00:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 03:00:43,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:43,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:43,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:43,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1904638586, now seen corresponding path program 1 times [2024-10-11 03:00:43,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:43,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987759401] [2024-10-11 03:00:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,756 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-11 03:00:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987759401] [2024-10-11 03:00:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987759401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43960666] [2024-10-11 03:00:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:43,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:00:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:00:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:43,787 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 65 states have internal predecessors, (84), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:43,860 INFO L93 Difference]: Finished difference Result 162 states and 233 transitions. [2024-10-11 03:00:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:00:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 03:00:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:43,874 INFO L225 Difference]: With dead ends: 162 [2024-10-11 03:00:43,875 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 03:00:43,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:43,885 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:43,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 03:00:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 03:00:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 61 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 03:00:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2024-10-11 03:00:43,930 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 12 [2024-10-11 03:00:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:43,931 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2024-10-11 03:00:43,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2024-10-11 03:00:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 03:00:43,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:43,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:43,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:00:43,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:43,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 443453378, now seen corresponding path program 1 times [2024-10-11 03:00:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093950841] [2024-10-11 03:00:43,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,043 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-11 03:00:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:44,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093950841] [2024-10-11 03:00:44,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093950841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:44,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811353432] [2024-10-11 03:00:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:44,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:44,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:44,048 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:44,092 INFO L93 Difference]: Finished difference Result 127 states and 173 transitions. [2024-10-11 03:00:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:44,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 03:00:44,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:44,095 INFO L225 Difference]: With dead ends: 127 [2024-10-11 03:00:44,095 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 03:00:44,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:44,098 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:44,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 03:00:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 03:00:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.446808510638298) internal successors, (68), 56 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 03:00:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2024-10-11 03:00:44,114 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 13 [2024-10-11 03:00:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:44,114 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2024-10-11 03:00:44,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2024-10-11 03:00:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:00:44,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:44,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:00:44,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1600980690, now seen corresponding path program 1 times [2024-10-11 03:00:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712957621] [2024-10-11 03:00:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,221 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-11 03:00:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712957621] [2024-10-11 03:00:44,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712957621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:44,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:44,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880940315] [2024-10-11 03:00:44,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:44,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:44,224 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:44,267 INFO L93 Difference]: Finished difference Result 136 states and 187 transitions. [2024-10-11 03:00:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 03:00:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:44,270 INFO L225 Difference]: With dead ends: 136 [2024-10-11 03:00:44,270 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 03:00:44,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 03:00:44,272 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:44,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 03:00:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 03:00:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.425531914893617) internal successors, (67), 56 states have internal predecessors, (67), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 03:00:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2024-10-11 03:00:44,288 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 16 [2024-10-11 03:00:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:44,288 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2024-10-11 03:00:44,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2024-10-11 03:00:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 03:00:44,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:44,290 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] [2024-10-11 03:00:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:00:44,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:44,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1814738836, now seen corresponding path program 1 times [2024-10-11 03:00:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95700259] [2024-10-11 03:00:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:00:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,398 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-11 03:00:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95700259] [2024-10-11 03:00:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95700259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:00:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201824187] [2024-10-11 03:00:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:44,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:44,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:44,403 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:44,716 INFO L93 Difference]: Finished difference Result 199 states and 267 transitions. [2024-10-11 03:00:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:00:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-11 03:00:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:44,718 INFO L225 Difference]: With dead ends: 199 [2024-10-11 03:00:44,718 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 03:00:44,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:44,724 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 130 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:44,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 128 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:00:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 03:00:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-10-11 03:00:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 98 states have internal predecessors, (121), 16 states have call successors, (16), 15 states have call predecessors, (16), 20 states have return successors, (27), 18 states have call predecessors, (27), 16 states have call successors, (27) [2024-10-11 03:00:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2024-10-11 03:00:44,764 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 26 [2024-10-11 03:00:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:44,764 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2024-10-11 03:00:44,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2024-10-11 03:00:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:00:44,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:44,766 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, 1] [2024-10-11 03:00:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:00:44,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -215112557, now seen corresponding path program 1 times [2024-10-11 03:00:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005243236] [2024-10-11 03:00:44,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,936 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-11 03:00:44,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:44,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005243236] [2024-10-11 03:00:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005243236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:00:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291731009] [2024-10-11 03:00:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:44,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:00:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:00:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:44,943 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 03:00:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:45,178 INFO L93 Difference]: Finished difference Result 326 states and 441 transitions. [2024-10-11 03:00:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-11 03:00:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:45,182 INFO L225 Difference]: With dead ends: 326 [2024-10-11 03:00:45,186 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 03:00:45,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-11 03:00:45,188 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:45,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 186 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 03:00:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2024-10-11 03:00:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 155 states have internal predecessors, (189), 26 states have call successors, (26), 25 states have call predecessors, (26), 30 states have return successors, (45), 28 states have call predecessors, (45), 26 states have call successors, (45) [2024-10-11 03:00:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 260 transitions. [2024-10-11 03:00:45,236 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 260 transitions. Word has length 36 [2024-10-11 03:00:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:45,237 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 260 transitions. [2024-10-11 03:00:45,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 03:00:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 260 transitions. [2024-10-11 03:00:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 03:00:45,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:45,242 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, 1, 1, 1, 1, 1] [2024-10-11 03:00:45,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:00:45,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:45,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1894869639, now seen corresponding path program 1 times [2024-10-11 03:00:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868944396] [2024-10-11 03:00:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,422 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-11 03:00:45,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:45,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868944396] [2024-10-11 03:00:45,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868944396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:45,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:45,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:45,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141405529] [2024-10-11 03:00:45,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:45,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:45,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:45,426 INFO L87 Difference]: Start difference. First operand 200 states and 260 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:45,839 INFO L93 Difference]: Finished difference Result 245 states and 319 transitions. [2024-10-11 03:00:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:45,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-10-11 03:00:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:45,843 INFO L225 Difference]: With dead ends: 245 [2024-10-11 03:00:45,843 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 03:00:45,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:45,849 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 180 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:45,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 160 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:00:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 03:00:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 225. [2024-10-11 03:00:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.30625) internal successors, (209), 177 states have internal predecessors, (209), 30 states have call successors, (30), 25 states have call predecessors, (30), 34 states have return successors, (55), 31 states have call predecessors, (55), 30 states have call successors, (55) [2024-10-11 03:00:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 294 transitions. [2024-10-11 03:00:45,903 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 294 transitions. Word has length 40 [2024-10-11 03:00:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:45,903 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 294 transitions. [2024-10-11 03:00:45,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 294 transitions. [2024-10-11 03:00:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 03:00:45,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:45,909 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:45,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:00:45,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:45,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:45,911 INFO L85 PathProgramCache]: Analyzing trace with hash 273228833, now seen corresponding path program 1 times [2024-10-11 03:00:45,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:45,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181160364] [2024-10-11 03:00:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,042 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-11 03:00:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:46,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181160364] [2024-10-11 03:00:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181160364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:46,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:46,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064235943] [2024-10-11 03:00:46,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:46,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:46,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:46,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:46,046 INFO L87 Difference]: Start difference. First operand 225 states and 294 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:46,321 INFO L93 Difference]: Finished difference Result 470 states and 640 transitions. [2024-10-11 03:00:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:46,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-11 03:00:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:46,324 INFO L225 Difference]: With dead ends: 470 [2024-10-11 03:00:46,324 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 03:00:46,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 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-11 03:00:46,326 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 122 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:46,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 164 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 03:00:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 229. [2024-10-11 03:00:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 164 states have (on average 1.298780487804878) internal successors, (213), 181 states have internal predecessors, (213), 30 states have call successors, (30), 25 states have call predecessors, (30), 34 states have return successors, (55), 31 states have call predecessors, (55), 30 states have call successors, (55) [2024-10-11 03:00:46,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2024-10-11 03:00:46,359 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 43 [2024-10-11 03:00:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:46,360 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2024-10-11 03:00:46,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2024-10-11 03:00:46,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 03:00:46,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:46,364 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:46,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:00:46,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1720915873, now seen corresponding path program 1 times [2024-10-11 03:00:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234450107] [2024-10-11 03:00:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,506 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-11 03:00:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234450107] [2024-10-11 03:00:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234450107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914168060] [2024-10-11 03:00:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:46,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:46,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:46,509 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 03:00:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:46,786 INFO L93 Difference]: Finished difference Result 441 states and 591 transitions. [2024-10-11 03:00:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:00:46,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-10-11 03:00:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:46,789 INFO L225 Difference]: With dead ends: 441 [2024-10-11 03:00:46,789 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 03:00:46,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:00:46,791 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 206 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:46,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 153 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 03:00:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 181. [2024-10-11 03:00:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 142 states have internal predecessors, (166), 25 states have call successors, (25), 21 states have call predecessors, (25), 26 states have return successors, (41), 24 states have call predecessors, (41), 25 states have call successors, (41) [2024-10-11 03:00:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 232 transitions. [2024-10-11 03:00:46,810 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 232 transitions. Word has length 43 [2024-10-11 03:00:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:46,811 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 232 transitions. [2024-10-11 03:00:46,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 03:00:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 232 transitions. [2024-10-11 03:00:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 03:00:46,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:46,812 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:46,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:00:46,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:46,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1756402973, now seen corresponding path program 1 times [2024-10-11 03:00:46,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:46,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336926581] [2024-10-11 03:00:46,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:46,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,901 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-11 03:00:46,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:46,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336926581] [2024-10-11 03:00:46,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336926581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:46,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:46,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234206895] [2024-10-11 03:00:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:46,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:46,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:46,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:46,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:46,905 INFO L87 Difference]: Start difference. First operand 181 states and 232 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:47,307 INFO L93 Difference]: Finished difference Result 407 states and 560 transitions. [2024-10-11 03:00:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-11 03:00:47,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:47,311 INFO L225 Difference]: With dead ends: 407 [2024-10-11 03:00:47,311 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 03:00:47,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:47,313 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 171 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:47,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 225 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:00:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 03:00:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2024-10-11 03:00:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 188 states have (on average 1.2606382978723405) internal successors, (237), 204 states have internal predecessors, (237), 35 states have call successors, (35), 30 states have call predecessors, (35), 37 states have return successors, (72), 37 states have call predecessors, (72), 35 states have call successors, (72) [2024-10-11 03:00:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 344 transitions. [2024-10-11 03:00:47,348 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 344 transitions. Word has length 43 [2024-10-11 03:00:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:47,348 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 344 transitions. [2024-10-11 03:00:47,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 03:00:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 344 transitions. [2024-10-11 03:00:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 03:00:47,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:47,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:47,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:00:47,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:47,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1165863272, now seen corresponding path program 1 times [2024-10-11 03:00:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798772157] [2024-10-11 03:00:47,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 03:00:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:00:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:00:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:47,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798772157] [2024-10-11 03:00:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798772157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:47,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120690671] [2024-10-11 03:00:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:47,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:47,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:00:47,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:00:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:47,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:00:47,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:47,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:00:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:00:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120690671] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:00:48,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:00:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-11 03:00:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412655414] [2024-10-11 03:00:48,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:00:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:00:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:00:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:00:48,072 INFO L87 Difference]: Start difference. First operand 261 states and 344 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 03:00:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:48,676 INFO L93 Difference]: Finished difference Result 627 states and 878 transitions. [2024-10-11 03:00:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:00:48,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 82 [2024-10-11 03:00:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:48,681 INFO L225 Difference]: With dead ends: 627 [2024-10-11 03:00:48,681 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 03:00:48,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:00:48,683 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 354 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:48,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 235 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:00:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 03:00:48,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 364. [2024-10-11 03:00:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 259 states have (on average 1.2664092664092663) internal successors, (328), 282 states have internal predecessors, (328), 51 states have call successors, (51), 44 states have call predecessors, (51), 53 states have return successors, (111), 50 states have call predecessors, (111), 51 states have call successors, (111) [2024-10-11 03:00:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 490 transitions. [2024-10-11 03:00:48,715 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 490 transitions. Word has length 82 [2024-10-11 03:00:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:48,716 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 490 transitions. [2024-10-11 03:00:48,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 03:00:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 490 transitions. [2024-10-11 03:00:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 03:00:48,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:48,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:00:48,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:00:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:00:48,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:48,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1569468605, now seen corresponding path program 2 times [2024-10-11 03:00:48,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:48,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068361832] [2024-10-11 03:00:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:00:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:00:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:00:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:00:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 44 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 03:00:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068361832] [2024-10-11 03:00:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068361832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042534502] [2024-10-11 03:00:49,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:00:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:49,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:00:49,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:00:49,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:00:49,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:00:49,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:00:49,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:00:49,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:00:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042534502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:49,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:00:49,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-10-11 03:00:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465403583] [2024-10-11 03:00:49,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:49,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:00:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:00:49,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:00:49,488 INFO L87 Difference]: Start difference. First operand 364 states and 490 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 03:00:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:49,724 INFO L93 Difference]: Finished difference Result 968 states and 1373 transitions. [2024-10-11 03:00:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-10-11 03:00:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:49,729 INFO L225 Difference]: With dead ends: 968 [2024-10-11 03:00:49,729 INFO L226 Difference]: Without dead ends: 646 [2024-10-11 03:00:49,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:49,732 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:49,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 430 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-10-11 03:00:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 625. [2024-10-11 03:00:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 446 states have (on average 1.2600896860986548) internal successors, (562), 477 states have internal predecessors, (562), 85 states have call successors, (85), 79 states have call predecessors, (85), 93 states have return successors, (174), 86 states have call predecessors, (174), 85 states have call successors, (174) [2024-10-11 03:00:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 821 transitions. [2024-10-11 03:00:49,779 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 821 transitions. Word has length 121 [2024-10-11 03:00:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:49,780 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 821 transitions. [2024-10-11 03:00:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 03:00:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 821 transitions. [2024-10-11 03:00:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 03:00:49,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:49,783 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 03:00:49,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:00:49,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:49,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:49,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1464581441, now seen corresponding path program 1 times [2024-10-11 03:00:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:49,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379097935] [2024-10-11 03:00:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:49,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 03:00:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:00:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:00:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 03:00:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:00:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 38 proven. 5 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 03:00:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:50,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379097935] [2024-10-11 03:00:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379097935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:50,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597338076] [2024-10-11 03:00:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:50,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:50,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:00:50,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:00:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:50,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:00:50,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 03:00:50,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:00:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597338076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:00:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-10-11 03:00:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824634570] [2024-10-11 03:00:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:50,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:50,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:50,264 INFO L87 Difference]: Start difference. First operand 625 states and 821 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 03:00:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:50,315 INFO L93 Difference]: Finished difference Result 859 states and 1116 transitions. [2024-10-11 03:00:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:50,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-10-11 03:00:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:50,317 INFO L225 Difference]: With dead ends: 859 [2024-10-11 03:00:50,317 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:00:50,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:50,320 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:50,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:00:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:00:50,321 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-11 03:00:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:00:50,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-10-11 03:00:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:00:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 03:00:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:00:50,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:00:50,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:00:50,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 03:00:50,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:50,532 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:50,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:00:52,007 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:00:52,022 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 03:00:52,028 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse0))) [2024-10-11 03:00:52,032 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 03:00:52,035 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and (= ~pumpRunning~0 0) .cse0 (<= 1 |old(~waterLevel~0)|)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse0))) [2024-10-11 03:00:52,039 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 03:00:52,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:00:52 BoogieIcfgContainer [2024-10-11 03:00:52,041 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:00:52,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:00:52,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:00:52,042 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:00:52,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:43" (3/4) ... [2024-10-11 03:00:52,045 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:00:52,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-11 03:00:52,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 03:00:52,048 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 03:00:52,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 03:00:52,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 03:00:52,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:52,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 03:00:52,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-10-11 03:00:52,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-10-11 03:00:52,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-10-11 03:00:52,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 03:00:52,060 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:00:52,060 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:00:52,060 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:00:52,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:00:52,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:00:52,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:00:52,175 INFO L158 Benchmark]: Toolchain (without parser) took 9996.65ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 122.6MB in the beginning and 162.2MB in the end (delta: -39.6MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,175 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:00:52,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.81ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 101.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.28ms. Allocated memory is still 155.2MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,176 INFO L158 Benchmark]: Boogie Preprocessor took 62.31ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 96.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,176 INFO L158 Benchmark]: RCFGBuilder took 662.33ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 107.1MB in the end (delta: -10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,177 INFO L158 Benchmark]: TraceAbstraction took 8571.42ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 106.1MB in the beginning and 170.6MB in the end (delta: -64.5MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,177 INFO L158 Benchmark]: Witness Printer took 132.22ms. Allocated memory is still 232.8MB. Free memory was 170.6MB in the beginning and 162.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 03:00:52,179 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.17ms. Allocated memory is still 104.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.81ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 101.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.28ms. Allocated memory is still 155.2MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.31ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 96.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 662.33ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 107.1MB in the end (delta: -10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8571.42ms. Allocated memory was 155.2MB in the beginning and 232.8MB in the end (delta: 77.6MB). Free memory was 106.1MB in the beginning and 170.6MB in the end (delta: -64.5MB). Peak memory consumption was 116.9MB. Max. memory is 16.1GB. * Witness Printer took 132.22ms. Allocated memory is still 232.8MB. Free memory was 170.6MB in the beginning and 162.2MB 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,"featureselect.i","") [58] - GenericResultAtLocation [Line: 96]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [96] - GenericResultAtLocation [Line: 347]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [347] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [415] - GenericResultAtLocation [Line: 519]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [519] - GenericResultAtLocation [Line: 545]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [545] - GenericResultAtLocation [Line: 911]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [911] * 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 10 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1529 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1503 mSDsluCounter, 2233 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1399 mSDsCounter, 483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2019 IncrementalHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 483 mSolverCounterUnsat, 834 mSDtfsCounter, 2019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 542 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=11, InterpolantAutomatonStates: 92, 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, 151 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 920 NumberOfCodeBlocks, 920 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 986 ConstructedInterpolants, 0 QuantifiedInterpolants, 1733 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1026 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 372/420 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: 253]: Location Invariant Derived location invariant: ((1 == systemActive) && (1 <= waterLevel)) - InvariantResult [Line: 360]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 245]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((1 == systemActive) && (1 <= waterLevel)) Ensures: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) - ProcedureContractResult [Line: 135]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) - ProcedureContractResult [Line: 443]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) - ProcedureContractResult [Line: 913]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 111]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: (((((1 == systemActive) && (\old(pumpRunning) == 0)) || ((1 == systemActive) && (2 <= \old(waterLevel)))) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 143]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((1 == systemActive) && (\old(pumpRunning) == 0)) && ((waterLevel != 1) || (pumpRunning == 0))) && (1 <= waterLevel)) - ProcedureContractResult [Line: 431]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: (((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (2 <= waterLevel)) && (1 == systemActive)) && ((1 < \old(waterLevel)) || ((pumpRunning == 0) && (\old(waterLevel) == 1)))) - ProcedureContractResult [Line: 169]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Requires: ((1 == systemActive) && (1 <= waterLevel)) Ensures: (((1 == systemActive) && (1 <= waterLevel)) && ((pumpRunning == 0) || (1 < waterLevel))) - ProcedureContractResult [Line: 253]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: ((1 == systemActive) && (1 <= waterLevel)) Ensures: ((1 == systemActive) && (1 <= waterLevel)) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:00:52,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE