./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product38.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 ca9ad45e9cd0fa7cfc478092837003ff1c91f26680d4fb1c37c440560090c9e6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:53:10,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:53:11,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:53:11,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:53:11,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:53:11,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:53:11,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:53:11,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:53:11,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:53:11,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:53:11,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:53:11,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:53:11,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:53:11,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:53:11,077 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:53:11,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:53:11,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:53:11,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:53:11,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:53:11,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:53:11,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:53:11,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:53:11,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:53:11,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:53:11,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:53:11,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:53:11,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:53:11,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:53:11,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:53:11,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:53:11,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:53:11,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:53:11,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:11,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:53:11,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:53:11,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:53:11,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:53:11,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:53:11,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:53:11,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:53:11,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:53:11,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:53:11,086 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 -> ca9ad45e9cd0fa7cfc478092837003ff1c91f26680d4fb1c37c440560090c9e6 [2024-11-11 20:53:11,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:53:11,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:53:11,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:53:11,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:53:11,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:53:11,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c [2024-11-11 20:53:12,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:53:13,025 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:53:13,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c [2024-11-11 20:53:13,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af55c10b/5c1c4add10d043bd956245e718cff702/FLAGccb807bb1 [2024-11-11 20:53:13,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af55c10b/5c1c4add10d043bd956245e718cff702 [2024-11-11 20:53:13,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:53:13,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:53:13,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:13,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:53:13,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:53:13,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bbf735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13, skipping insertion in model container [2024-11-11 20:53:13,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:53:13,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c[1605,1618] [2024-11-11 20:53:13,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:13,492 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:53:13,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-11-11 20:53:13,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [58] [2024-11-11 20:53:13,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [99] [2024-11-11 20:53:13,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [137] [2024-11-11 20:53:13,505 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [331] [2024-11-11 20:53:13,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [401] [2024-11-11 20:53:13,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [498] [2024-11-11 20:53:13,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [593] [2024-11-11 20:53:13,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product38.cil.c[1605,1618] [2024-11-11 20:53:13,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:53:13,605 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:53:13,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13 WrapperNode [2024-11-11 20:53:13,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:53:13,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:13,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:53:13,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:53:13,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,664 INFO L138 Inliner]: procedures = 55, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 197 [2024-11-11 20:53:13,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:53:13,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:53:13,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:53:13,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:53:13,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:53:13,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:53:13,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:53:13,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:53:13,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:53:13,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (1/1) ... [2024-11-11 20:53:13,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:53:13,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:13,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:53:13,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:53:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:53:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:53:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:53:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:53:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:53:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:53:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:53:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:53:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:53:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:53:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:53:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:53:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:53:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:53:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:53:13,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:53:13,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:53:13,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:53:14,172 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-11 20:53:14,172 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:53:14,188 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:53:14,188 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:53:14,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:14 BoogieIcfgContainer [2024-11-11 20:53:14,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:53:14,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:53:14,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:53:14,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:53:14,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:53:13" (1/3) ... [2024-11-11 20:53:14,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10369d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:14, skipping insertion in model container [2024-11-11 20:53:14,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:53:13" (2/3) ... [2024-11-11 20:53:14,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10369d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:53:14, skipping insertion in model container [2024-11-11 20:53:14,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:14" (3/3) ... [2024-11-11 20:53:14,196 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product38.cil.c [2024-11-11 20:53:14,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:53:14,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:53:14,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:53:14,264 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;@3d3ceff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:53:14,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:53:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 75 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-11 20:53:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:53:14,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:14,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:14,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1803312447, now seen corresponding path program 1 times [2024-11-11 20:53:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492475980] [2024-11-11 20:53:14,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:14,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:53:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:14,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:14,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492475980] [2024-11-11 20:53:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492475980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:14,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:14,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:53:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027914770] [2024-11-11 20:53:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:53:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:53:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:14,528 INFO L87 Difference]: Start difference. First operand has 88 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 75 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:14,552 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions. [2024-11-11 20:53:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:53:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:53:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:14,566 INFO L225 Difference]: With dead ends: 167 [2024-11-11 20:53:14,566 INFO L226 Difference]: Without dead ends: 79 [2024-11-11 20:53:14,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:53:14,575 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:14,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-11 20:53:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-11 20:53:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 67 states have internal predecessors, (79), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:53:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-11-11 20:53:14,618 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 25 [2024-11-11 20:53:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:14,619 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-11-11 20:53:14,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-11-11 20:53:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:53:14,621 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:14,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:14,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:53:14,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:14,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash 220336758, now seen corresponding path program 1 times [2024-11-11 20:53:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063533143] [2024-11-11 20:53:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:53:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063533143] [2024-11-11 20:53:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063533143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:14,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:14,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629769723] [2024-11-11 20:53:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:14,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:14,766 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:14,795 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2024-11-11 20:53:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:14,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:53:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:14,797 INFO L225 Difference]: With dead ends: 122 [2024-11-11 20:53:14,799 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 20:53:14,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:14,802 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:14,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 20:53:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-11 20:53:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 61 states have internal predecessors, (72), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:53:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-11 20:53:14,817 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 26 [2024-11-11 20:53:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:14,817 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-11 20:53:14,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:53:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-11 20:53:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 20:53:14,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:14,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:14,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:53:14,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash 753977737, now seen corresponding path program 1 times [2024-11-11 20:53:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597604447] [2024-11-11 20:53:14,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:14,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597604447] [2024-11-11 20:53:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597604447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:14,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:53:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942885239] [2024-11-11 20:53:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:14,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:15,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:15,005 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-11 20:53:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:15,027 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions. [2024-11-11 20:53:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:15,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-11 20:53:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:15,029 INFO L225 Difference]: With dead ends: 132 [2024-11-11 20:53:15,029 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 20:53:15,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:53:15,031 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:15,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 20:53:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-11 20:53:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 61 states have internal predecessors, (71), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-11 20:53:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-11-11 20:53:15,048 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 31 [2024-11-11 20:53:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:15,051 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-11-11 20:53:15,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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-11 20:53:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-11-11 20:53:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 20:53:15,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:15,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:53:15,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:15,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:15,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1236058631, now seen corresponding path program 1 times [2024-11-11 20:53:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412063479] [2024-11-11 20:53:15,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:53:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:15,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412063479] [2024-11-11 20:53:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412063479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:15,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:15,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768837364] [2024-11-11 20:53:15,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:15,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:15,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:15,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:15,231 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:53:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:15,469 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2024-11-11 20:53:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:15,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2024-11-11 20:53:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:15,471 INFO L225 Difference]: With dead ends: 207 [2024-11-11 20:53:15,471 INFO L226 Difference]: Without dead ends: 145 [2024-11-11 20:53:15,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:53:15,477 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 161 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:15,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 281 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-11 20:53:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-11-11 20:53:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.280373831775701) internal successors, (137), 114 states have internal predecessors, (137), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-11 20:53:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2024-11-11 20:53:15,505 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 41 [2024-11-11 20:53:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:15,505 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2024-11-11 20:53:15,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:53:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2024-11-11 20:53:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 20:53:15,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:15,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:15,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:53:15,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:15,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash -649911993, now seen corresponding path program 1 times [2024-11-11 20:53:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:15,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459738874] [2024-11-11 20:53:15,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:53:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459738874] [2024-11-11 20:53:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459738874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:15,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:15,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:15,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107461615] [2024-11-11 20:53:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:15,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:15,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:15,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:15,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:15,654 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:15,814 INFO L93 Difference]: Finished difference Result 275 states and 344 transitions. [2024-11-11 20:53:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 20:53:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 20:53:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:15,816 INFO L225 Difference]: With dead ends: 275 [2024-11-11 20:53:15,816 INFO L226 Difference]: Without dead ends: 144 [2024-11-11 20:53:15,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:15,819 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 48 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:15,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 352 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-11 20:53:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-11 20:53:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 117 states have internal predecessors, (140), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-11 20:53:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2024-11-11 20:53:15,844 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 45 [2024-11-11 20:53:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2024-11-11 20:53:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2024-11-11 20:53:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 20:53:15,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:15,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:15,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:53:15,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1956111561, now seen corresponding path program 1 times [2024-11-11 20:53:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:15,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594714581] [2024-11-11 20:53:15,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:53:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594714581] [2024-11-11 20:53:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594714581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364608646] [2024-11-11 20:53:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:15,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:15,981 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:16,100 INFO L93 Difference]: Finished difference Result 280 states and 352 transitions. [2024-11-11 20:53:16,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:53:16,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 20:53:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:16,103 INFO L225 Difference]: With dead ends: 280 [2024-11-11 20:53:16,103 INFO L226 Difference]: Without dead ends: 146 [2024-11-11 20:53:16,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:16,106 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 47 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:16,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 276 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-11 20:53:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-11 20:53:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 119 states have internal predecessors, (142), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-11 20:53:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2024-11-11 20:53:16,124 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 45 [2024-11-11 20:53:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:16,125 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2024-11-11 20:53:16,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2024-11-11 20:53:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 20:53:16,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:16,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:16,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:53:16,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:16,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1916153909, now seen corresponding path program 1 times [2024-11-11 20:53:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225632904] [2024-11-11 20:53:16,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 20:53:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:16,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225632904] [2024-11-11 20:53:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225632904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91060723] [2024-11-11 20:53:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:16,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:16,218 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:16,403 INFO L93 Difference]: Finished difference Result 405 states and 519 transitions. [2024-11-11 20:53:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 20:53:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:16,406 INFO L225 Difference]: With dead ends: 405 [2024-11-11 20:53:16,406 INFO L226 Difference]: Without dead ends: 269 [2024-11-11 20:53:16,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:53:16,407 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 198 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:16,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 287 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-11 20:53:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2024-11-11 20:53:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 212 states have internal predecessors, (253), 30 states have call successors, (30), 28 states have call predecessors, (30), 29 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-11 20:53:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 328 transitions. [2024-11-11 20:53:16,460 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 328 transitions. Word has length 45 [2024-11-11 20:53:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 328 transitions. [2024-11-11 20:53:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:53:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 328 transitions. [2024-11-11 20:53:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 20:53:16,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:16,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:16,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:53:16,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:16,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1607715167, now seen corresponding path program 1 times [2024-11-11 20:53:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:16,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306026087] [2024-11-11 20:53:16,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:53:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:53:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:16,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:16,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306026087] [2024-11-11 20:53:16,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306026087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:53:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850908916] [2024-11-11 20:53:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:53:16,578 INFO L87 Difference]: Start difference. First operand 261 states and 328 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:53:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:16,766 INFO L93 Difference]: Finished difference Result 512 states and 650 transitions. [2024-11-11 20:53:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:53:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-11 20:53:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:16,771 INFO L225 Difference]: With dead ends: 512 [2024-11-11 20:53:16,771 INFO L226 Difference]: Without dead ends: 259 [2024-11-11 20:53:16,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:53:16,775 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 100 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:16,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 291 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-11 20:53:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-11-11 20:53:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 208 states have internal predecessors, (241), 30 states have call successors, (30), 28 states have call predecessors, (30), 29 states have return successors, (45), 30 states have call predecessors, (45), 30 states have call successors, (45) [2024-11-11 20:53:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 316 transitions. [2024-11-11 20:53:16,810 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 316 transitions. Word has length 47 [2024-11-11 20:53:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:16,810 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 316 transitions. [2024-11-11 20:53:16,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:53:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 316 transitions. [2024-11-11 20:53:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-11 20:53:16,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:16,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:16,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:53:16,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:16,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:16,813 INFO L85 PathProgramCache]: Analyzing trace with hash 715309297, now seen corresponding path program 1 times [2024-11-11 20:53:16,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:16,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814548746] [2024-11-11 20:53:16,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:16,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:53:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:16,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814548746] [2024-11-11 20:53:16,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814548746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:53:16,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:53:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500234959] [2024-11-11 20:53:16,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:16,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:53:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:16,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:53:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:53:16,894 INFO L87 Difference]: Start difference. First operand 257 states and 316 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:53:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:17,188 INFO L93 Difference]: Finished difference Result 473 states and 598 transitions. [2024-11-11 20:53:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:53:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-11 20:53:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:17,192 INFO L225 Difference]: With dead ends: 473 [2024-11-11 20:53:17,192 INFO L226 Difference]: Without dead ends: 471 [2024-11-11 20:53:17,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:53:17,196 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 264 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:17,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 214 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:53:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-11 20:53:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 431. [2024-11-11 20:53:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 330 states have (on average 1.2242424242424241) internal successors, (404), 351 states have internal predecessors, (404), 52 states have call successors, (52), 42 states have call predecessors, (52), 48 states have return successors, (94), 51 states have call predecessors, (94), 52 states have call successors, (94) [2024-11-11 20:53:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 550 transitions. [2024-11-11 20:53:17,242 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 550 transitions. Word has length 49 [2024-11-11 20:53:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:17,242 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 550 transitions. [2024-11-11 20:53:17,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 20:53:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 550 transitions. [2024-11-11 20:53:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 20:53:17,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:17,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:53:17,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:17,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1623088946, now seen corresponding path program 1 times [2024-11-11 20:53:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144982995] [2024-11-11 20:53:17,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:53:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:53:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:53:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144982995] [2024-11-11 20:53:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144982995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613142282] [2024-11-11 20:53:17,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:17,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:17,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:17,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:17,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:53:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 20:53:17,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:53:17,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613142282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:17,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:17,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-11 20:53:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418147716] [2024-11-11 20:53:17,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:17,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:53:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:17,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:53:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:53:17,579 INFO L87 Difference]: Start difference. First operand 431 states and 550 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:53:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:17,620 INFO L93 Difference]: Finished difference Result 756 states and 980 transitions. [2024-11-11 20:53:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:53:17,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 88 [2024-11-11 20:53:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:17,623 INFO L225 Difference]: With dead ends: 756 [2024-11-11 20:53:17,623 INFO L226 Difference]: Without dead ends: 382 [2024-11-11 20:53:17,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:53:17,625 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 37 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:17,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-11 20:53:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-11-11 20:53:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 292 states have (on average 1.2191780821917808) internal successors, (356), 311 states have internal predecessors, (356), 47 states have call successors, (47), 37 states have call predecessors, (47), 42 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) [2024-11-11 20:53:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 475 transitions. [2024-11-11 20:53:17,657 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 475 transitions. Word has length 88 [2024-11-11 20:53:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:17,657 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 475 transitions. [2024-11-11 20:53:17,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 20:53:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 475 transitions. [2024-11-11 20:53:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:53:17,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:17,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:17,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:53:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 20:53:17,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1045609474, now seen corresponding path program 1 times [2024-11-11 20:53:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311039453] [2024-11-11 20:53:17,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 20:53:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:53:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:53:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:53:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 20:53:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311039453] [2024-11-11 20:53:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311039453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445280652] [2024-11-11 20:53:18,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:18,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:18,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:53:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:18,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 20:53:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 20:53:18,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:53:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:53:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445280652] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:53:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-11 20:53:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199820647] [2024-11-11 20:53:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:53:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:18,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:53:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:53:18,489 INFO L87 Difference]: Start difference. First operand 382 states and 475 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:18,629 INFO L93 Difference]: Finished difference Result 1070 states and 1366 transitions. [2024-11-11 20:53:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:18,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-11-11 20:53:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:18,636 INFO L225 Difference]: With dead ends: 1070 [2024-11-11 20:53:18,636 INFO L226 Difference]: Without dead ends: 696 [2024-11-11 20:53:18,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:53:18,638 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:18,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 394 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:53:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-11 20:53:18,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 646. [2024-11-11 20:53:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 488 states have (on average 1.1885245901639345) internal successors, (580), 522 states have internal predecessors, (580), 81 states have call successors, (81), 65 states have call predecessors, (81), 76 states have return successors, (125), 81 states have call predecessors, (125), 81 states have call successors, (125) [2024-11-11 20:53:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 786 transitions. [2024-11-11 20:53:18,700 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 786 transitions. Word has length 93 [2024-11-11 20:53:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 786 transitions. [2024-11-11 20:53:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 20:53:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 786 transitions. [2024-11-11 20:53:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 20:53:18,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:53:18,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:18,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:53:18,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 20:53:18,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:53:18,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:53:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash 429876390, now seen corresponding path program 1 times [2024-11-11 20:53:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:53:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559564178] [2024-11-11 20:53:18,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:53:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:53:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:53:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:53:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:53:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 20:53:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:53:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:53:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:53:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:53:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 20:53:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:53:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559564178] [2024-11-11 20:53:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559564178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:53:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560714861] [2024-11-11 20:53:19,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:53:19,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:19,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:53:19,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:53:19,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:53:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:53:19,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:53:19,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:53:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 20:53:19,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:53:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560714861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:53:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:53:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2024-11-11 20:53:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170171074] [2024-11-11 20:53:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:53:19,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:53:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:53:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:53:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:53:19,323 INFO L87 Difference]: Start difference. First operand 646 states and 786 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 20:53:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:53:19,495 INFO L93 Difference]: Finished difference Result 1174 states and 1422 transitions. [2024-11-11 20:53:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:53:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2024-11-11 20:53:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:53:19,497 INFO L225 Difference]: With dead ends: 1174 [2024-11-11 20:53:19,498 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:53:19,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:53:19,501 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 24 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:53:19,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 779 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:53:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:53:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:53:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:53:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:53:19,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2024-11-11 20:53:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:53:19,504 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:53:19,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-11 20:53:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:53:19,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:53:19,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:53:19,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:53:19,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:53:19,711 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:53:19,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:53:23,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:53:23,330 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or (<= 1 ~methaneLevelCritical~0) (< |old(~methaneLevelCritical~0)| 1)) (let ((.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 2 ~waterLevel~0) .cse3) (and .cse0 .cse1 .cse5 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (or (not .cse2) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (let ((.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= 2 ~waterLevel~0) .cse3) (and .cse0 .cse1 .cse5 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (or (< |old(~methaneLevelCritical~0)| 1) (< 0 ~methaneLevelCritical~0)) (or (not .cse2) (= ~methaneLevelCritical~0 0))))) [2024-11-11 20:53:23,340 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:53:23,353 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= |old(~methAndRunningLastTime~0)| 0)) (.cse0 (= |old(~pumpRunning~0)| 0))) (and (or (not .cse0) .cse1) (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (not .cse2) .cse1 (< ~methaneLevelCritical~0 1)) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse3 (= ~methaneLevelCritical~0 0)) (.cse6 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= 1 ~systemActive~0)) (.cse5 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse3 .cse4 .cse5) (and .cse3 .cse2 .cse4 .cse0) (and .cse6 .cse2 .cse4 .cse5) (and .cse6 .cse2 .cse4 .cse0) (and .cse6 .cse4 (<= 2 |old(~waterLevel~0)|) .cse5))))) Eliminated clause: (let ((.cse6 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~pumpRunning~0 0))) (and (exists ((|old(~methAndRunningLastTime~0)| Int)) (let ((.cse4 (= |old(~methAndRunningLastTime~0)| 0))) (and (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= 1 ~methaneLevelCritical~0)) (.cse1 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse3 .cse4 .cse2) (and .cse5 .cse3 .cse4 .cse2) (and .cse5 .cse1 .cse4 .cse2))) (or (not .cse4) .cse6 (< ~methaneLevelCritical~0 1))))) (or .cse6 (not .cse5)))) [2024-11-11 20:53:23,365 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:53:23,376 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methAndRunningLastTime~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 (<= 1 |old(~pumpRunning~0)|)) (and .cse2 (<= 1 ~methaneLevelCritical~0) .cse1 .cse3) (and .cse2 .cse0 .cse1 .cse3)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-11-11 20:53:23,385 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse4 (<= 1 ~pumpRunning~0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse5 .cse3) (and .cse4 .cse2 .cse3 (<= 2 |old(~waterLevel~0)|)) (and .cse0 .cse1 .cse5 .cse3))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 (<= 2 ~waterLevel~0) .cse3) (and .cse4 .cse1 .cse5 .cse3) (and .cse0 .cse1 .cse5 .cse3))) [2024-11-11 20:53:23,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:53:23 BoogieIcfgContainer [2024-11-11 20:53:23,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:53:23,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:53:23,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:53:23,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:53:23,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:53:14" (3/4) ... [2024-11-11 20:53:23,397 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:53:23,401 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:53:23,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:53:23,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:53:23,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:53:23,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:53:23,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-11 20:53:23,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:53:23,411 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 20:53:23,412 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:53:23,412 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:53:23,413 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:23,413 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:53:23,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:53:23,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:53:23,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:53:23,532 INFO L158 Benchmark]: Toolchain (without parser) took 10456.14ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 75.7MB in the beginning and 142.0MB in the end (delta: -66.2MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,532 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:53:23,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.80ms. Allocated memory is still 146.8MB. Free memory was 75.4MB in the beginning and 106.2MB in the end (delta: -30.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.83ms. Allocated memory is still 146.8MB. Free memory was 106.2MB in the beginning and 104.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,533 INFO L158 Benchmark]: Boogie Preprocessor took 54.88ms. Allocated memory is still 146.8MB. Free memory was 104.1MB in the beginning and 102.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,533 INFO L158 Benchmark]: RCFGBuilder took 465.40ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 83.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,533 INFO L158 Benchmark]: TraceAbstraction took 9201.81ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 82.6MB in the beginning and 150.3MB in the end (delta: -67.7MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,534 INFO L158 Benchmark]: Witness Printer took 138.71ms. Allocated memory is still 218.1MB. Free memory was 150.3MB in the beginning and 142.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:53:23,539 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.16ms. Allocated memory is still 117.4MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.80ms. Allocated memory is still 146.8MB. Free memory was 75.4MB in the beginning and 106.2MB in the end (delta: -30.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.83ms. Allocated memory is still 146.8MB. Free memory was 106.2MB in the beginning and 104.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.88ms. Allocated memory is still 146.8MB. Free memory was 104.1MB in the beginning and 102.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.40ms. Allocated memory is still 146.8MB. Free memory was 102.0MB in the beginning and 83.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9201.81ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 82.6MB in the beginning and 150.3MB in the end (delta: -67.7MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 138.71ms. Allocated memory is still 218.1MB. Free memory was 150.3MB in the beginning and 142.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [58] - GenericResultAtLocation [Line: 99]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [99] - GenericResultAtLocation [Line: 137]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [137] - GenericResultAtLocation [Line: 331]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [331] - GenericResultAtLocation [Line: 401]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [401] - GenericResultAtLocation [Line: 498]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [498] - GenericResultAtLocation [Line: 593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [593] - 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: 54]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1054 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1023 mSDsluCounter, 3427 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2242 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 1185 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 110 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 1946 SizeOfPredicates, 3 NumberOfNonLiveVariables, 940 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 227/242 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: 344]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) - ProcedureContractResult [Line: 173]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && (((((((methAndRunningLastTime == \old(methAndRunningLastTime)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 526]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: ((((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 <= \old(methaneLevelCritical))) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive))) && ((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) && ((((((methAndRunningLastTime == \old(methAndRunningLastTime)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (head == \old(head)))) - ProcedureContractResult [Line: 403]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 149]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((methAndRunningLastTime == 0) || (pumpRunning != 0)) Ensures: ((((((((\old(pumpRunning) < 1) || (methaneLevelCritical < 1)) || ((pumpRunning == 0) && (methAndRunningLastTime == 0))) && ((methAndRunningLastTime == 0) || (methaneLevelCritical != 0))) && (((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1)) || ((pumpRunning == 0) && (methAndRunningLastTime == 0)))) && (((\old(pumpRunning) != 0) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) == waterLevel))) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (\old(waterLevel) == waterLevel)))) && (((((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning))) || ((((methaneLevelCritical == 0) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (1 <= \old(pumpRunning)))) || ((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((1 <= methaneLevelCritical) && (1 == systemActive)) && (2 <= \old(waterLevel))) && (1 <= \old(pumpRunning))))) && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 538]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: ((((methaneLevelCritical <= \result) && ((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)))) && ((methaneLevelCritical != 0) || (\result == 0))) && (((((((methAndRunningLastTime == \old(methAndRunningLastTime)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 181]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || ((1 <= pumpRunning) && (2 <= waterLevel)))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) && ((((((methAndRunningLastTime == \old(methAndRunningLastTime)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 514]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((pumpRunning != 0) || (\old(waterLevel) != 1)) || (1 < waterLevel)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)))) && ((((((methAndRunningLastTime == \old(methAndRunningLastTime)) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:53:23,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE