./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 449370313253a0d5d7b509b2cd15e912fe8e85dcb7140575e7078385cf7fc6cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:15:04,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:15:04,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:15:04,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:15:04,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:15:04,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:15:04,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:15:04,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:15:04,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:15:04,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:15:04,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:15:04,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:15:04,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:15:04,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:15:04,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:15:04,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:15:04,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:15:04,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:15:04,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:15:04,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:15:04,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:15:04,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:15:04,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:15:04,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:15:04,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:15:04,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:15:04,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:15:04,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:15:04,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:15:04,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:15:04,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:15:04,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:15:04,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:15:04,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:15:04,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:15:04,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:15:04,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 449370313253a0d5d7b509b2cd15e912fe8e85dcb7140575e7078385cf7fc6cf [2024-11-08 15:15:04,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:15:04,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:15:04,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:15:04,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:15:04,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:15:04,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2024-11-08 15:15:06,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:15:06,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:15:06,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2024-11-08 15:15:06,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a778f3c/1a75cb4c239a4921a2501d9315834ca4/FLAG17ecbc7cd [2024-11-08 15:15:06,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a778f3c/1a75cb4c239a4921a2501d9315834ca4 [2024-11-08 15:15:06,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:15:06,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:15:06,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:15:06,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:15:06,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:15:06,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:15:06" (1/1) ... [2024-11-08 15:15:06,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14acb12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:06, skipping insertion in model container [2024-11-08 15:15:06,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:15:06" (1/1) ... [2024-11-08 15:15:06,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:15:06,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c[7477,7490] [2024-11-08 15:15:07,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:15:07,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:15:07,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-11-08 15:15:07,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] [2024-11-08 15:15:07,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] [2024-11-08 15:15:07,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] [2024-11-08 15:15:07,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [502] [2024-11-08 15:15:07,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [511] [2024-11-08 15:15:07,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [546] [2024-11-08 15:15:07,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [912] [2024-11-08 15:15:07,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c[7477,7490] [2024-11-08 15:15:07,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:15:07,085 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:15:07,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07 WrapperNode [2024-11-08 15:15:07,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:15:07,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:15:07,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:15:07,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:15:07,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,124 INFO L138 Inliner]: procedures = 54, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 196 [2024-11-08 15:15:07,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:15:07,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:15:07,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:15:07,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:15:07,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,153 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:15:07,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:15:07,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:15:07,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:15:07,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:15:07,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (1/1) ... [2024-11-08 15:15:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:15:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:15:07,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:15:07,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:15:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:15:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:15:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:15:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-08 15:15:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-08 15:15:07,258 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:15:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:15:07,258 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:15:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:15:07,258 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:15:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:15:07,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:15:07,258 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:15:07,258 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:15:07,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:15:07,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:15:07,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:15:07,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:15:07,522 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-08 15:15:07,522 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:15:07,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:15:07,543 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:15:07,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:15:07 BoogieIcfgContainer [2024-11-08 15:15:07,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:15:07,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:15:07,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:15:07,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:15:07,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:15:06" (1/3) ... [2024-11-08 15:15:07,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d782edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:15:07, skipping insertion in model container [2024-11-08 15:15:07,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:15:07" (2/3) ... [2024-11-08 15:15:07,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d782edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:15:07, skipping insertion in model container [2024-11-08 15:15:07,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:15:07" (3/3) ... [2024-11-08 15:15:07,550 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product42.cil.c [2024-11-08 15:15:07,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:15:07,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:15:07,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:15:07,620 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;@6786f93e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:15:07,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:15:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 15:15:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 15:15:07,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:07,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:07,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:07,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1617756963, now seen corresponding path program 1 times [2024-11-08 15:15:07,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:07,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322701149] [2024-11-08 15:15:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:15:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:07,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322701149] [2024-11-08 15:15:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322701149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:15:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193020085] [2024-11-08 15:15:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:07,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:15:07,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:15:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:15:07,837 INFO L87 Difference]: Start difference. First operand has 82 states, 64 states have (on average 1.390625) internal successors, (89), 70 states have internal predecessors, (89), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:07,858 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2024-11-08 15:15:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:15:07,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-08 15:15:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:07,869 INFO L225 Difference]: With dead ends: 156 [2024-11-08 15:15:07,869 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 15:15:07,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:15:07,876 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:07,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 15:15:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 15:15:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:15:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2024-11-08 15:15:07,931 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 25 [2024-11-08 15:15:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:07,932 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2024-11-08 15:15:07,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2024-11-08 15:15:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 15:15:07,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:07,934 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-11-08 15:15:07,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:15:07,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1176803179, now seen corresponding path program 1 times [2024-11-08 15:15:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882384494] [2024-11-08 15:15:07,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:07,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:15:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:08,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882384494] [2024-11-08 15:15:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882384494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:08,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:08,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:15:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077068343] [2024-11-08 15:15:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:08,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:15:08,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:08,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:15:08,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:15:08,087 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:08,103 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2024-11-08 15:15:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:15:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-08 15:15:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:08,105 INFO L225 Difference]: With dead ends: 111 [2024-11-08 15:15:08,105 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 15:15:08,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:15:08,107 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:08,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 15:15:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 15:15:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:15:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-11-08 15:15:08,124 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 26 [2024-11-08 15:15:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:08,124 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-11-08 15:15:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-11-08 15:15:08,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 15:15:08,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:08,126 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] [2024-11-08 15:15:08,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:15:08,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:08,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash 414343402, now seen corresponding path program 1 times [2024-11-08 15:15:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:08,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938807797] [2024-11-08 15:15:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938807797] [2024-11-08 15:15:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938807797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:08,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:15:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62538276] [2024-11-08 15:15:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:15:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:08,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:15:08,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:15:08,257 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:08,317 INFO L93 Difference]: Finished difference Result 121 states and 158 transitions. [2024-11-08 15:15:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:15:08,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-08 15:15:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:08,319 INFO L225 Difference]: With dead ends: 121 [2024-11-08 15:15:08,319 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 15:15:08,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:08,321 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:08,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 232 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 15:15:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 15:15:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:15:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2024-11-08 15:15:08,329 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 31 [2024-11-08 15:15:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:08,329 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-11-08 15:15:08,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:15:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2024-11-08 15:15:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 15:15:08,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:08,331 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-11-08 15:15:08,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:15:08,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:08,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash 808202887, now seen corresponding path program 1 times [2024-11-08 15:15:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037250088] [2024-11-08 15:15:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:15:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:15:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037250088] [2024-11-08 15:15:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037250088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:08,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:08,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:15:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692765603] [2024-11-08 15:15:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:15:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:15:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:15:08,423 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:15:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:08,460 INFO L93 Difference]: Finished difference Result 163 states and 210 transitions. [2024-11-08 15:15:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:15:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-08 15:15:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:08,464 INFO L225 Difference]: With dead ends: 163 [2024-11-08 15:15:08,464 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 15:15:08,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:15:08,466 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:08,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 15:15:08,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2024-11-08 15:15:08,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 89 states have internal predecessors, (107), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-08 15:15:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2024-11-08 15:15:08,485 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 36 [2024-11-08 15:15:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:08,485 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2024-11-08 15:15:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:15:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2024-11-08 15:15:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 15:15:08,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:08,487 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] [2024-11-08 15:15:08,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:15:08,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:08,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 165647039, now seen corresponding path program 1 times [2024-11-08 15:15:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152749988] [2024-11-08 15:15:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 15:15:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:15:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152749988] [2024-11-08 15:15:08,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152749988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:08,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:08,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:15:08,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694455038] [2024-11-08 15:15:08,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:08,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:15:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:15:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:15:08,665 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:15:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:08,725 INFO L93 Difference]: Finished difference Result 282 states and 371 transitions. [2024-11-08 15:15:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:15:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 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 42 [2024-11-08 15:15:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:08,727 INFO L225 Difference]: With dead ends: 282 [2024-11-08 15:15:08,727 INFO L226 Difference]: Without dead ends: 185 [2024-11-08 15:15:08,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:08,728 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 34 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:08,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 290 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-08 15:15:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-08 15:15:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 156 states have internal predecessors, (187), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (27), 19 states have call predecessors, (27), 21 states have call successors, (27) [2024-11-08 15:15:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2024-11-08 15:15:08,748 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 42 [2024-11-08 15:15:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:08,749 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2024-11-08 15:15:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:15:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2024-11-08 15:15:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:15:08,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:08,752 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, 1, 1, 1] [2024-11-08 15:15:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:15:08,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1345519451, now seen corresponding path program 1 times [2024-11-08 15:15:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999146063] [2024-11-08 15:15:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:15:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:15:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999146063] [2024-11-08 15:15:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999146063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:15:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94123793] [2024-11-08 15:15:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:15:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:15:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:15:08,853 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:09,026 INFO L93 Difference]: Finished difference Result 451 states and 601 transitions. [2024-11-08 15:15:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:15:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 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 46 [2024-11-08 15:15:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:09,029 INFO L225 Difference]: With dead ends: 451 [2024-11-08 15:15:09,029 INFO L226 Difference]: Without dead ends: 354 [2024-11-08 15:15:09,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:15:09,030 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 150 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:09,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 295 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-08 15:15:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-11-08 15:15:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 277 states have (on average 1.2707581227436824) internal successors, (352), 300 states have internal predecessors, (352), 39 states have call successors, (39), 27 states have call predecessors, (39), 31 states have return successors, (59), 37 states have call predecessors, (59), 39 states have call successors, (59) [2024-11-08 15:15:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 450 transitions. [2024-11-08 15:15:09,094 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 450 transitions. Word has length 46 [2024-11-08 15:15:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 450 transitions. [2024-11-08 15:15:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 450 transitions. [2024-11-08 15:15:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:15:09,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:09,096 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, 1, 1, 1] [2024-11-08 15:15:09,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:15:09,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1126664733, now seen corresponding path program 1 times [2024-11-08 15:15:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718159757] [2024-11-08 15:15:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:15:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:15:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:09,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:09,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718159757] [2024-11-08 15:15:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718159757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:15:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089921527] [2024-11-08 15:15:09,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:09,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:15:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:15:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:15:09,196 INFO L87 Difference]: Start difference. First operand 348 states and 450 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:09,289 INFO L93 Difference]: Finished difference Result 614 states and 802 transitions. [2024-11-08 15:15:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:15:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 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 46 [2024-11-08 15:15:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:09,293 INFO L225 Difference]: With dead ends: 614 [2024-11-08 15:15:09,293 INFO L226 Difference]: Without dead ends: 350 [2024-11-08 15:15:09,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:15:09,294 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:09,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 251 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-08 15:15:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2024-11-08 15:15:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 277 states have (on average 1.263537906137184) internal successors, (350), 300 states have internal predecessors, (350), 39 states have call successors, (39), 27 states have call predecessors, (39), 31 states have return successors, (59), 37 states have call predecessors, (59), 39 states have call successors, (59) [2024-11-08 15:15:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 448 transitions. [2024-11-08 15:15:09,328 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 448 transitions. Word has length 46 [2024-11-08 15:15:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:09,328 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 448 transitions. [2024-11-08 15:15:09,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 448 transitions. [2024-11-08 15:15:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 15:15:09,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:09,331 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, 1, 1, 1] [2024-11-08 15:15:09,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:15:09,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:09,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1944313183, now seen corresponding path program 1 times [2024-11-08 15:15:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782202604] [2024-11-08 15:15:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:15:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:15:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:09,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:09,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782202604] [2024-11-08 15:15:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782202604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:15:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672497106] [2024-11-08 15:15:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:09,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:15:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:09,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:15:09,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:15:09,412 INFO L87 Difference]: Start difference. First operand 348 states and 448 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:09,528 INFO L93 Difference]: Finished difference Result 696 states and 909 transitions. [2024-11-08 15:15:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:15:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 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 46 [2024-11-08 15:15:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:09,533 INFO L225 Difference]: With dead ends: 696 [2024-11-08 15:15:09,533 INFO L226 Difference]: Without dead ends: 355 [2024-11-08 15:15:09,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:15:09,535 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:09,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 313 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-08 15:15:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2024-11-08 15:15:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.249122807017544) internal successors, (356), 306 states have internal predecessors, (356), 37 states have call successors, (37), 26 states have call predecessors, (37), 30 states have return successors, (57), 35 states have call predecessors, (57), 37 states have call successors, (57) [2024-11-08 15:15:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 450 transitions. [2024-11-08 15:15:09,557 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 450 transitions. Word has length 46 [2024-11-08 15:15:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 450 transitions. [2024-11-08 15:15:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 450 transitions. [2024-11-08 15:15:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:15:09,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:09,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:15:09,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1025339665, now seen corresponding path program 1 times [2024-11-08 15:15:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616292297] [2024-11-08 15:15:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:15:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:15:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:15:09,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616292297] [2024-11-08 15:15:09,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616292297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:15:09,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783865772] [2024-11-08 15:15:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:15:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:15:09,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:15:09,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:15:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:09,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 15:15:09,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:15:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:15:09,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:15:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783865772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:09,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:15:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-11-08 15:15:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268740987] [2024-11-08 15:15:09,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:09,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:15:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:09,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:15:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:15:09,891 INFO L87 Difference]: Start difference. First operand 353 states and 450 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:09,968 INFO L93 Difference]: Finished difference Result 1008 states and 1311 transitions. [2024-11-08 15:15:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:15:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-08 15:15:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:09,971 INFO L225 Difference]: With dead ends: 1008 [2024-11-08 15:15:09,971 INFO L226 Difference]: Without dead ends: 662 [2024-11-08 15:15:09,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:15:09,972 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 43 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:09,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 440 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:15:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-08 15:15:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2024-11-08 15:15:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 531 states have (on average 1.231638418079096) internal successors, (654), 566 states have internal predecessors, (654), 71 states have call successors, (71), 51 states have call predecessors, (71), 57 states have return successors, (113), 67 states have call predecessors, (113), 71 states have call successors, (113) [2024-11-08 15:15:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 838 transitions. [2024-11-08 15:15:10,001 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 838 transitions. Word has length 51 [2024-11-08 15:15:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:10,002 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 838 transitions. [2024-11-08 15:15:10,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 838 transitions. [2024-11-08 15:15:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:15:10,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:10,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:10,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:15:10,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:15:10,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 468700430, now seen corresponding path program 1 times [2024-11-08 15:15:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022715143] [2024-11-08 15:15:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:15:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 15:15:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:15:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022715143] [2024-11-08 15:15:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022715143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:15:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236949336] [2024-11-08 15:15:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:15:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:10,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:15:10,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:15:10,278 INFO L87 Difference]: Start difference. First operand 660 states and 838 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:10,446 INFO L93 Difference]: Finished difference Result 1223 states and 1570 transitions. [2024-11-08 15:15:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:15:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 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 52 [2024-11-08 15:15:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:10,448 INFO L225 Difference]: With dead ends: 1223 [2024-11-08 15:15:10,448 INFO L226 Difference]: Without dead ends: 256 [2024-11-08 15:15:10,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:15:10,451 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 108 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:10,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 527 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:15:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-08 15:15:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 247. [2024-11-08 15:15:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 197 states have (on average 1.1878172588832487) internal successors, (234), 208 states have internal predecessors, (234), 26 states have call successors, (26), 23 states have call predecessors, (26), 23 states have return successors, (31), 24 states have call predecessors, (31), 26 states have call successors, (31) [2024-11-08 15:15:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 291 transitions. [2024-11-08 15:15:10,484 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 291 transitions. Word has length 52 [2024-11-08 15:15:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:10,484 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 291 transitions. [2024-11-08 15:15:10,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:15:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 291 transitions. [2024-11-08 15:15:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 15:15:10,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:15:10,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:10,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:15:10,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:15:10,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:15:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1675825877, now seen corresponding path program 1 times [2024-11-08 15:15:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:15:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701324979] [2024-11-08 15:15:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:15:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:15:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:15:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:15:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:15:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:15:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:15:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:15:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:15:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701324979] [2024-11-08 15:15:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701324979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:15:10,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:15:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 15:15:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783003674] [2024-11-08 15:15:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:15:10,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:15:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:15:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:15:10,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:15:10,580 INFO L87 Difference]: Start difference. First operand 247 states and 291 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:15:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:15:10,871 INFO L93 Difference]: Finished difference Result 477 states and 568 transitions. [2024-11-08 15:15:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 15:15:10,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-08 15:15:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:15:10,872 INFO L225 Difference]: With dead ends: 477 [2024-11-08 15:15:10,872 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:15:10,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:15:10,873 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 114 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:15:10,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 338 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:15:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:15:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:15:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:15:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:15:10,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2024-11-08 15:15:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:15:10,874 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:15:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 15:15:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:15:10,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:15:10,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:15:10,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:15:10,879 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:15:10,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:15:13,807 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:15:13,864 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or .cse0 (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) (let ((.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= 1 |old(~methaneLevelCritical~0)|) .cse1) (and .cse0 .cse1) (and .cse2 .cse1))) (or (not .cse2) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or .cse0 (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0)) (let ((.cse1 (not (= 0 ~systemActive~0)))) (or (and (<= 1 |old(~methaneLevelCritical~0)|) .cse1) (and .cse0 .cse1) (and .cse2 .cse1))) (or (not .cse2) (= ~methaneLevelCritical~0 0))))) [2024-11-08 15:15:13,868 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 15:15:13,882 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse3 (= |old(~pumpRunning~0)| 0))) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse2 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse0 (not .cse3))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and (not .cse1) .cse2)) (let ((.cse4 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse4) (and .cse0 .cse4) (and (<= 1 ~methaneLevelCritical~0) .cse4)))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse3 (= |old(~pumpRunning~0)| 0))) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse2 (= |old(~waterLevel~0)| ~waterLevel~0)) (.cse0 (not .cse3))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and (not .cse1) .cse2)) (let ((.cse4 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) .cse4) (and .cse0 .cse4) (and (<= 1 ~methaneLevelCritical~0) .cse4))))))) [2024-11-08 15:15:13,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 15:15:13,896 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (not (= ~pumpRunning~0 0)) .cse0) (and (<= 1 ~methaneLevelCritical~0) .cse0) (and (= ~methaneLevelCritical~0 0) (<= |old(~waterLevel~0)| 1) .cse0))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (not (= 0 ~systemActive~0)))) (or (and (= ~methaneLevelCritical~0 0) (<= ~waterLevel~0 1) .cse0) (and (not (= ~pumpRunning~0 0)) .cse0) (and (<= 1 ~methaneLevelCritical~0) .cse0))) [2024-11-08 15:15:13,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:15:13 BoogieIcfgContainer [2024-11-08 15:15:13,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:15:13,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:15:13,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:15:13,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:15:13,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:15:07" (3/4) ... [2024-11-08 15:15:13,904 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:15:13,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-08 15:15:13,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-08 15:15:13,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-08 15:15:13,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-08 15:15:13,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-08 15:15:13,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-08 15:15:13,914 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-08 15:15:13,914 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:15:13,915 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:15:13,915 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:15:13,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:15:14,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:15:14,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:15:14,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:15:14,021 INFO L158 Benchmark]: Toolchain (without parser) took 7363.06ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 80.1MB in the beginning and 188.9MB in the end (delta: -108.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:15:14,021 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 109.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:15:14,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.95ms. Allocated memory is still 153.1MB. Free memory was 79.8MB in the beginning and 107.3MB in the end (delta: -27.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-08 15:15:14,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.38ms. Allocated memory is still 153.1MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:15:14,021 INFO L158 Benchmark]: Boogie Preprocessor took 51.78ms. Allocated memory is still 153.1MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:15:14,022 INFO L158 Benchmark]: RCFGBuilder took 366.13ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 85.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 15:15:14,022 INFO L158 Benchmark]: TraceAbstraction took 6355.71ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 84.2MB in the beginning and 196.2MB in the end (delta: -112.0MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-11-08 15:15:14,022 INFO L158 Benchmark]: Witness Printer took 119.48ms. Allocated memory is still 247.5MB. Free memory was 196.2MB in the beginning and 188.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:15:14,024 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.15ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 109.4MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.95ms. Allocated memory is still 153.1MB. Free memory was 79.8MB in the beginning and 107.3MB in the end (delta: -27.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.38ms. Allocated memory is still 153.1MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.78ms. Allocated memory is still 153.1MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.13ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 85.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6355.71ms. Allocated memory was 153.1MB in the beginning and 247.5MB in the end (delta: 94.4MB). Free memory was 84.2MB in the beginning and 196.2MB in the end (delta: -112.0MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * Witness Printer took 119.48ms. Allocated memory is still 247.5MB. Free memory was 196.2MB in the beginning and 188.9MB in the end (delta: 7.3MB). 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,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] - GenericResultAtLocation [Line: 221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] - GenericResultAtLocation [Line: 407]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] - GenericResultAtLocation [Line: 502]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [502] - GenericResultAtLocation [Line: 511]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [511] - GenericResultAtLocation [Line: 546]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [546] - GenericResultAtLocation [Line: 912]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [912] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 507]: 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 7 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 722 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 3078 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2234 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1126 IncrementalHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 844 mSDtfsCounter, 1126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=9, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 SizeOfPredicates, 1 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 10/12 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: 164]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((pumpRunning != 0) && (splverifierCounter == 0)) && (0 != systemActive)) || ((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (splverifierCounter == 0)) && (0 != systemActive))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 257]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (waterLevel <= 1)) && (0 != systemActive))) Ensures: ((((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (waterLevel <= 1)) && (0 != systemActive))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 435]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: ((((((\old(methaneLevelCritical) != 0) || (pumpRunning != 0)) || (0 < methaneLevelCritical)) && (((pumpRunning != 0) || (methaneLevelCritical == 0)) || (\old(methaneLevelCritical) < 1))) && ((((1 <= \old(methaneLevelCritical)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((\old(methaneLevelCritical) == 0) && (0 != systemActive)))) && (((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (head == \old(head)))) - ProcedureContractResult [Line: 447]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((methaneLevelCritical == 0) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive))) Ensures: (((((pumpRunning != 0) || (\result == methaneLevelCritical)) && ((((methaneLevelCritical == 0) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive)))) && ((methaneLevelCritical != 0) || (\result == 0))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 233]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((1 < \old(waterLevel)) || (waterLevel < 2)) && (((pumpRunning != 0) || (methaneLevelCritical != 0)) || (waterLevel < 2))) && ((((methaneLevelCritical == 0) && (0 != systemActive)) || ((\old(pumpRunning) != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) && ((pumpRunning != 0) || (\old(pumpRunning) == 0))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 52]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 423]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((methaneLevelCritical == 0) && (waterLevel <= 1)) && (0 != systemActive)) || ((pumpRunning != 0) && (0 != systemActive))) || ((1 <= methaneLevelCritical) && (0 != systemActive))) Ensures: (((((pumpRunning != 0) && (0 != systemActive)) || ((1 <= methaneLevelCritical) && (0 != systemActive))) || (((methaneLevelCritical == 0) && (\old(waterLevel) <= 1)) && (0 != systemActive))) && (((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:15:14,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE