./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product60.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product60.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fa225959be52b1defd5d055d32ae3a8dd944c37a01adb589e2f547028e60f67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:58:00,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:58:00,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:58:00,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:58:00,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:58:00,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:58:00,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:58:00,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:58:00,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:58:00,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:58:00,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:58:00,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:58:00,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:58:00,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:58:00,722 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:58:00,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:58:00,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:58:00,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:58:00,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:58:00,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:58:00,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:58:00,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:58:00,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:58:00,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:58:00,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:58:00,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:58:00,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:58:00,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:58:00,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:58:00,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:58:00,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:58:00,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:58:00,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:00,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:58:00,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:58:00,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:58:00,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:58:00,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:58:00,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:58:00,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:58:00,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:58:00,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:58:00,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fa225959be52b1defd5d055d32ae3a8dd944c37a01adb589e2f547028e60f67 [2024-10-11 02:58:00,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:58:00,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:58:01,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:58:01,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:58:01,005 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:58:01,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product60.cil.c [2024-10-11 02:58:02,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:58:02,729 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:58:02,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product60.cil.c [2024-10-11 02:58:02,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f727ce9fe/919f7c06e04045c39ec11b9759e66e77/FLAG901a700c7 [2024-10-11 02:58:03,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f727ce9fe/919f7c06e04045c39ec11b9759e66e77 [2024-10-11 02:58:03,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:58:03,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:58:03,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:03,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:58:03,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:58:03,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26465f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03, skipping insertion in model container [2024-10-11 02:58:03,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:58:03,441 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product60.cil.c[14569,14582] [2024-10-11 02:58:03,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:03,500 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:58:03,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-10-11 02:58:03,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [153] [2024-10-11 02:58:03,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [262] [2024-10-11 02:58:03,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [290] [2024-10-11 02:58:03,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [656] [2024-10-11 02:58:03,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [665] [2024-10-11 02:58:03,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [736] [2024-10-11 02:58:03,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [976] [2024-10-11 02:58:03,579 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product60.cil.c[14569,14582] [2024-10-11 02:58:03,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:03,643 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:58:03,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03 WrapperNode [2024-10-11 02:58:03,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:03,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:03,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:58:03,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:58:03,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,704 INFO L138 Inliner]: procedures = 58, calls = 103, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 221 [2024-10-11 02:58:03,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:03,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:58:03,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:58:03,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:58:03,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 02:58:03,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:58:03,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:58:03,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:58:03,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:58:03,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (1/1) ... [2024-10-11 02:58:03,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:03,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:03,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:58:03,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:58:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:58:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:58:03,850 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:58:03,850 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:58:03,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:58:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:58:03,851 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:58:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:58:03,851 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:58:03,851 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:03,852 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:03,852 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:58:03,852 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:58:03,853 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 02:58:03,853 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 02:58:03,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:58:03,853 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:58:03,854 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:58:03,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:58:03,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:58:03,957 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:58:03,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:58:04,265 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-11 02:58:04,265 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:58:04,336 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:58:04,337 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:58:04,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:04 BoogieIcfgContainer [2024-10-11 02:58:04,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:58:04,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:58:04,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:58:04,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:58:04,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:58:03" (1/3) ... [2024-10-11 02:58:04,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb58a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:04, skipping insertion in model container [2024-10-11 02:58:04,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:03" (2/3) ... [2024-10-11 02:58:04,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb58a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:04, skipping insertion in model container [2024-10-11 02:58:04,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:04" (3/3) ... [2024-10-11 02:58:04,347 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product60.cil.c [2024-10-11 02:58:04,364 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:58:04,364 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:58:04,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:58:04,440 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;@63ecf59c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:58:04,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:58:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 53 states have (on average 1.528301886792453) internal successors, (81), 62 states have internal predecessors, (81), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 02:58:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 02:58:04,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:04,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:04,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:04,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1616753094, now seen corresponding path program 1 times [2024-10-11 02:58:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903089082] [2024-10-11 02:58:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:04,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:58:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:04,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903089082] [2024-10-11 02:58:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903089082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:04,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:58:04,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979975365] [2024-10-11 02:58:04,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:58:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:04,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:58:04,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:04,702 INFO L87 Difference]: Start difference. First operand has 77 states, 53 states have (on average 1.528301886792453) internal successors, (81), 62 states have internal predecessors, (81), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:04,774 INFO L93 Difference]: Finished difference Result 152 states and 219 transitions. [2024-10-11 02:58:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:58:04,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 02:58:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:04,787 INFO L225 Difference]: With dead ends: 152 [2024-10-11 02:58:04,788 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 02:58:04,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:04,794 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:04,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 02:58:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 02:58:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.42) internal successors, (71), 58 states have internal predecessors, (71), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 02:58:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2024-10-11 02:58:04,838 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 16 [2024-10-11 02:58:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:04,839 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2024-10-11 02:58:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2024-10-11 02:58:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:58:04,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:04,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:04,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:58:04,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:04,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1506062791, now seen corresponding path program 1 times [2024-10-11 02:58:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916019817] [2024-10-11 02:58:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:58:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:04,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:04,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916019817] [2024-10-11 02:58:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916019817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:04,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891328510] [2024-10-11 02:58:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:04,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:04,943 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:04,987 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2024-10-11 02:58:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 02:58:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:04,988 INFO L225 Difference]: With dead ends: 114 [2024-10-11 02:58:04,989 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 02:58:04,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:04,990 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:04,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 130 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 02:58:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 02:58:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 53 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 02:58:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2024-10-11 02:58:05,000 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 17 [2024-10-11 02:58:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:05,000 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2024-10-11 02:58:05,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2024-10-11 02:58:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 02:58:05,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:05,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:58:05,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:05,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1095535619, now seen corresponding path program 1 times [2024-10-11 02:58:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588743384] [2024-10-11 02:58:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588743384] [2024-10-11 02:58:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588743384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:05,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409433463] [2024-10-11 02:58:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:05,131 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:05,213 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2024-10-11 02:58:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 02:58:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:05,216 INFO L225 Difference]: With dead ends: 188 [2024-10-11 02:58:05,216 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 02:58:05,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:05,221 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 81 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:05,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 02:58:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-10-11 02:58:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 101 states have internal predecessors, (125), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 02:58:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2024-10-11 02:58:05,249 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 20 [2024-10-11 02:58:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2024-10-11 02:58:05,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2024-10-11 02:58:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 02:58:05,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:05,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:05,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:58:05,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -672055808, now seen corresponding path program 1 times [2024-10-11 02:58:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786419056] [2024-10-11 02:58:05,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:58:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786419056] [2024-10-11 02:58:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786419056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:05,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:58:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402066394] [2024-10-11 02:58:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:05,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:58:05,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:58:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:58:05,350 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:05,475 INFO L93 Difference]: Finished difference Result 320 states and 447 transitions. [2024-10-11 02:58:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:58:05,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 02:58:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:05,478 INFO L225 Difference]: With dead ends: 320 [2024-10-11 02:58:05,479 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 02:58:05,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:05,481 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 61 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:05,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 187 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 02:58:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-10-11 02:58:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.3829787234042554) internal successors, (195), 158 states have internal predecessors, (195), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2024-10-11 02:58:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2024-10-11 02:58:05,509 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 23 [2024-10-11 02:58:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:05,509 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2024-10-11 02:58:05,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2024-10-11 02:58:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:58:05,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:05,511 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:05,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:58:05,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:05,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -943497671, now seen corresponding path program 1 times [2024-10-11 02:58:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301563468] [2024-10-11 02:58:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:58:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:58:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:05,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301563468] [2024-10-11 02:58:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301563468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:05,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:05,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517830584] [2024-10-11 02:58:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:05,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:05,773 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:05,960 INFO L93 Difference]: Finished difference Result 436 states and 593 transitions. [2024-10-11 02:58:05,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 02:58:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:05,964 INFO L225 Difference]: With dead ends: 436 [2024-10-11 02:58:05,964 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 02:58:05,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:05,972 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:05,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 02:58:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2024-10-11 02:58:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 188 states have internal predecessors, (231), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-10-11 02:58:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 313 transitions. [2024-10-11 02:58:06,031 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 313 transitions. Word has length 38 [2024-10-11 02:58:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:06,031 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 313 transitions. [2024-10-11 02:58:06,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 313 transitions. [2024-10-11 02:58:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:58:06,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:06,037 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:58:06,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:06,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:06,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1761146121, now seen corresponding path program 1 times [2024-10-11 02:58:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733992939] [2024-10-11 02:58:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:58:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:58:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733992939] [2024-10-11 02:58:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733992939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458930192] [2024-10-11 02:58:06,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:06,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:06,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:06,150 INFO L87 Difference]: Start difference. First operand 238 states and 313 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:06,327 INFO L93 Difference]: Finished difference Result 480 states and 647 transitions. [2024-10-11 02:58:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 02:58:06,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:06,331 INFO L225 Difference]: With dead ends: 480 [2024-10-11 02:58:06,333 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 02:58:06,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:06,335 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 48 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:06,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 178 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 02:58:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-10-11 02:58:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 192 states have internal predecessors, (235), 34 states have call successors, (34), 26 states have call predecessors, (34), 32 states have return successors, (48), 35 states have call predecessors, (48), 34 states have call successors, (48) [2024-10-11 02:58:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 317 transitions. [2024-10-11 02:58:06,359 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 317 transitions. Word has length 38 [2024-10-11 02:58:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:06,359 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 317 transitions. [2024-10-11 02:58:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 317 transitions. [2024-10-11 02:58:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:58:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:06,361 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:58:06,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:06,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1542291403, now seen corresponding path program 1 times [2024-10-11 02:58:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531023448] [2024-10-11 02:58:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:58:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:58:06,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:06,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531023448] [2024-10-11 02:58:06,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531023448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:06,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:06,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:06,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355008391] [2024-10-11 02:58:06,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:06,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:06,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:06,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:06,483 INFO L87 Difference]: Start difference. First operand 242 states and 317 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:58:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:06,852 INFO L93 Difference]: Finished difference Result 785 states and 1101 transitions. [2024-10-11 02:58:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:58:06,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-11 02:58:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:06,857 INFO L225 Difference]: With dead ends: 785 [2024-10-11 02:58:06,857 INFO L226 Difference]: Without dead ends: 545 [2024-10-11 02:58:06,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:06,864 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 183 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:06,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 261 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:58:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-11 02:58:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 537. [2024-10-11 02:58:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 386 states have (on average 1.33419689119171) internal successors, (515), 417 states have internal predecessors, (515), 80 states have call successors, (80), 71 states have call predecessors, (80), 70 states have return successors, (130), 74 states have call predecessors, (130), 80 states have call successors, (130) [2024-10-11 02:58:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 725 transitions. [2024-10-11 02:58:06,927 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 725 transitions. Word has length 38 [2024-10-11 02:58:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:06,928 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 725 transitions. [2024-10-11 02:58:06,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:58:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 725 transitions. [2024-10-11 02:58:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:58:06,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:06,930 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:06,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:58:06,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:06,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 558304731, now seen corresponding path program 1 times [2024-10-11 02:58:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524184954] [2024-10-11 02:58:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:58:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:58:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:58:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524184954] [2024-10-11 02:58:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524184954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:58:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922770529] [2024-10-11 02:58:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:58:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:58:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:07,074 INFO L87 Difference]: Start difference. First operand 537 states and 725 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:58:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:07,646 INFO L93 Difference]: Finished difference Result 1786 states and 2508 transitions. [2024-10-11 02:58:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:58:07,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-11 02:58:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:07,656 INFO L225 Difference]: With dead ends: 1786 [2024-10-11 02:58:07,657 INFO L226 Difference]: Without dead ends: 1251 [2024-10-11 02:58:07,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-11 02:58:07,662 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 268 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:07,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 254 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:58:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-10-11 02:58:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1245. [2024-10-11 02:58:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 888 states have (on average 1.28490990990991) internal successors, (1141), 965 states have internal predecessors, (1141), 196 states have call successors, (196), 142 states have call predecessors, (196), 160 states have return successors, (352), 188 states have call predecessors, (352), 196 states have call successors, (352) [2024-10-11 02:58:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1689 transitions. [2024-10-11 02:58:07,786 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1689 transitions. Word has length 42 [2024-10-11 02:58:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1689 transitions. [2024-10-11 02:58:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:58:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1689 transitions. [2024-10-11 02:58:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 02:58:07,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:07,791 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:07,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:58:07,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:07,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2043931009, now seen corresponding path program 1 times [2024-10-11 02:58:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425634805] [2024-10-11 02:58:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:58:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:58:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 02:58:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:58:07,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:07,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425634805] [2024-10-11 02:58:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425634805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:07,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679142794] [2024-10-11 02:58:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:07,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:07,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:58:07,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:58:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:58:08,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:08,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679142794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-11 02:58:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270184894] [2024-10-11 02:58:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:08,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:58:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:58:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:58:08,205 INFO L87 Difference]: Start difference. First operand 1245 states and 1689 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 02:58:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:08,475 INFO L93 Difference]: Finished difference Result 2436 states and 3316 transitions. [2024-10-11 02:58:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:58:08,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2024-10-11 02:58:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:08,485 INFO L225 Difference]: With dead ends: 2436 [2024-10-11 02:58:08,486 INFO L226 Difference]: Without dead ends: 1193 [2024-10-11 02:58:08,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:58:08,493 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 61 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:08,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 347 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-10-11 02:58:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-10-11 02:58:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 850 states have (on average 1.2694117647058825) internal successors, (1079), 925 states have internal predecessors, (1079), 190 states have call successors, (190), 138 states have call predecessors, (190), 152 states have return successors, (314), 178 states have call predecessors, (314), 190 states have call successors, (314) [2024-10-11 02:58:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1583 transitions. [2024-10-11 02:58:08,583 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1583 transitions. Word has length 46 [2024-10-11 02:58:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:08,583 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1583 transitions. [2024-10-11 02:58:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 02:58:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1583 transitions. [2024-10-11 02:58:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 02:58:08,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:08,587 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:58:08,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:58:08,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:08,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash -276738347, now seen corresponding path program 1 times [2024-10-11 02:58:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210683264] [2024-10-11 02:58:08,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:08,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:58:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:58:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:58:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:58:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 02:58:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210683264] [2024-10-11 02:58:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210683264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:08,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:58:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290195749] [2024-10-11 02:58:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:08,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:58:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:08,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:58:08,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:08,923 INFO L87 Difference]: Start difference. First operand 1193 states and 1583 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 02:58:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:09,445 INFO L93 Difference]: Finished difference Result 1968 states and 2593 transitions. [2024-10-11 02:58:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:58:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 70 [2024-10-11 02:58:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:09,453 INFO L225 Difference]: With dead ends: 1968 [2024-10-11 02:58:09,453 INFO L226 Difference]: Without dead ends: 777 [2024-10-11 02:58:09,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:58:09,457 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 255 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:09,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 148 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:58:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-11 02:58:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 763. [2024-10-11 02:58:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 545 states have (on average 1.2532110091743118) internal successors, (683), 593 states have internal predecessors, (683), 119 states have call successors, (119), 94 states have call predecessors, (119), 98 states have return successors, (181), 113 states have call predecessors, (181), 119 states have call successors, (181) [2024-10-11 02:58:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 983 transitions. [2024-10-11 02:58:09,516 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 983 transitions. Word has length 70 [2024-10-11 02:58:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 983 transitions. [2024-10-11 02:58:09,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 02:58:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 983 transitions. [2024-10-11 02:58:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 02:58:09,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:09,521 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:09,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:58:09,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:09,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 879516092, now seen corresponding path program 1 times [2024-10-11 02:58:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109623546] [2024-10-11 02:58:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:58:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:58:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:58:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:58:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:58:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109623546] [2024-10-11 02:58:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109623546] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791802081] [2024-10-11 02:58:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:09,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:09,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:58:09,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:58:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:09,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:58:09,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:58:09,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791802081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2024-10-11 02:58:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582132419] [2024-10-11 02:58:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:09,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:58:09,915 INFO L87 Difference]: Start difference. First operand 763 states and 983 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:58:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:10,119 INFO L93 Difference]: Finished difference Result 2021 states and 2658 transitions. [2024-10-11 02:58:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:10,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-10-11 02:58:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:10,128 INFO L225 Difference]: With dead ends: 2021 [2024-10-11 02:58:10,129 INFO L226 Difference]: Without dead ends: 1260 [2024-10-11 02:58:10,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:58:10,133 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 108 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:10,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 318 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-10-11 02:58:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1137. [2024-10-11 02:58:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 813 states have (on average 1.2496924969249692) internal successors, (1016), 881 states have internal predecessors, (1016), 177 states have call successors, (177), 146 states have call predecessors, (177), 146 states have return successors, (271), 159 states have call predecessors, (271), 177 states have call successors, (271) [2024-10-11 02:58:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1464 transitions. [2024-10-11 02:58:10,248 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1464 transitions. Word has length 79 [2024-10-11 02:58:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:10,249 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1464 transitions. [2024-10-11 02:58:10,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:58:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1464 transitions. [2024-10-11 02:58:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 02:58:10,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:10,251 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:58:10,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:10,456 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:10,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash 61867642, now seen corresponding path program 1 times [2024-10-11 02:58:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916893411] [2024-10-11 02:58:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:58:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:58:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:58:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:58:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:58:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916893411] [2024-10-11 02:58:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916893411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813917048] [2024-10-11 02:58:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:10,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:10,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:58:10,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:58:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:10,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:58:10,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 02:58:10,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:10,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813917048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-10-11 02:58:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051282682] [2024-10-11 02:58:10,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:10,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:58:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:58:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:58:10,715 INFO L87 Difference]: Start difference. First operand 1137 states and 1464 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:58:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:10,788 INFO L93 Difference]: Finished difference Result 1657 states and 2105 transitions. [2024-10-11 02:58:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:58:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2024-10-11 02:58:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:10,791 INFO L225 Difference]: With dead ends: 1657 [2024-10-11 02:58:10,791 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:58:10,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:58:10,796 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:10,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:58:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:58:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 02:58:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:58:10,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-10-11 02:58:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:58:10,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:58:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:58:10,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:58:10,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:58:10,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:58:11,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:11,007 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:11,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:58:14,887 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:58:14,911 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (<= 2 ~waterLevel~0)) (.cse2 (not (= 0 ~systemActive~0))) (.cse5 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 1 ~systemActive~0)) (.cse4 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse3 .cse4)))) Eliminated clause: (let ((.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (<= 2 ~waterLevel~0)) (.cse2 (not (= 0 ~systemActive~0))) (.cse5 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 1 ~systemActive~0)) (.cse4 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse3 .cse4))) [2024-10-11 02:58:14,930 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (and (= |old(~methaneLevelCritical~0)| ~methaneLevelCritical~0) (let ((.cse3 (= 0 ~systemActive~0)) (.cse4 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= |old(~methaneLevelCritical~0)| 0)) (.cse5 (= 1 ~systemActive~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2) (and .cse1 (<= 2 ~waterLevel~0) .cse5) (and .cse0 .cse1 .cse5 .cse2)))) Eliminated clause: (let ((.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse5 (= 1 ~systemActive~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (<= 2 ~waterLevel~0) .cse5) (and .cse0 .cse1 .cse5 .cse2) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2))) [2024-10-11 02:58:14,962 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (< 1 |old(~waterLevel~0)|) (and (= ~pumpRunning~0 0) (= ~waterLevel~0 1))) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 1 ~systemActive~0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse1 (= |old(~pumpRunning~0)| 0)) (.cse2 (= 0 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse4 .cse3) (and .cse4 .cse1 .cse2)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0))) (and (or (< 1 ~waterLevel~0) (and .cse0 (= ~waterLevel~0 1))) (let ((.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= 0 ~systemActive~0))) (or (and .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse3 .cse2) (and .cse0 .cse1 .cse4))))) [2024-10-11 02:58:14,978 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= |old(~pumpRunning~0)| 0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1 .cse2) (and (= ~methaneLevelCritical~0 0) .cse0 .cse1 .cse2)))) Eliminated clause: (and (= ~pumpRunning~0 0) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= 1 ~waterLevel~0))) (or (and (= ~methaneLevelCritical~0 0) .cse0 .cse1) (and (<= 1 ~methaneLevelCritical~0) .cse0 .cse1)))) [2024-10-11 02:58:14,988 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse3 (<= 1 |old(~waterLevel~0)|)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3) (and .cse5 .cse2 (<= 2 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse1 (<= 1 ~methaneLevelCritical~0)) (.cse3 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse4 (= ~methaneLevelCritical~0 0)) (.cse5 (= 1 ~systemActive~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (<= 2 ~waterLevel~0) .cse5) (and .cse0 .cse1 .cse5 .cse2) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse2))) [2024-10-11 02:58:14,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:58:14 BoogieIcfgContainer [2024-10-11 02:58:14,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:58:14,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:58:14,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:58:14,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:58:14,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:04" (3/4) ... [2024-10-11 02:58:15,000 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 02:58:15,004 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-11 02:58:15,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 02:58:15,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 02:58:15,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-11 02:58:15,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 02:58:15,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 02:58:15,006 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:15,006 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 02:58:15,016 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2024-10-11 02:58:15,016 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 02:58:15,017 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 02:58:15,017 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:58:15,018 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:58:15,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:58:15,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 02:58:15,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:58:15,130 INFO L158 Benchmark]: Toolchain (without parser) took 12052.58ms. Allocated memory was 134.2MB in the beginning and 278.9MB in the end (delta: 144.7MB). Free memory was 77.9MB in the beginning and 146.2MB in the end (delta: -68.3MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,130 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 134.2MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:58:15,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.23ms. Allocated memory is still 134.2MB. Free memory was 77.6MB in the beginning and 104.4MB in the end (delta: -26.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.36ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 104.4MB in the beginning and 159.9MB in the end (delta: -55.5MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,131 INFO L158 Benchmark]: Boogie Preprocessor took 55.89ms. Allocated memory is still 188.7MB. Free memory was 159.9MB in the beginning and 157.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,131 INFO L158 Benchmark]: RCFGBuilder took 575.76ms. Allocated memory is still 188.7MB. Free memory was 157.8MB in the beginning and 132.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,131 INFO L158 Benchmark]: TraceAbstraction took 10657.22ms. Allocated memory was 188.7MB in the beginning and 278.9MB in the end (delta: 90.2MB). Free memory was 131.6MB in the beginning and 153.5MB in the end (delta: -21.9MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,131 INFO L158 Benchmark]: Witness Printer took 131.58ms. Allocated memory is still 278.9MB. Free memory was 153.5MB in the beginning and 146.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 02:58:15,133 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.62ms. Allocated memory is still 134.2MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.23ms. Allocated memory is still 134.2MB. Free memory was 77.6MB in the beginning and 104.4MB in the end (delta: -26.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.36ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 104.4MB in the beginning and 159.9MB in the end (delta: -55.5MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.89ms. Allocated memory is still 188.7MB. Free memory was 159.9MB in the beginning and 157.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 575.76ms. Allocated memory is still 188.7MB. Free memory was 157.8MB in the beginning and 132.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10657.22ms. Allocated memory was 188.7MB in the beginning and 278.9MB in the end (delta: 90.2MB). Free memory was 131.6MB in the beginning and 153.5MB in the end (delta: -21.9MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Witness Printer took 131.58ms. Allocated memory is still 278.9MB. Free memory was 153.5MB in the beginning and 146.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [153] - GenericResultAtLocation [Line: 262]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [262] - GenericResultAtLocation [Line: 290]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [290] - GenericResultAtLocation [Line: 656]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [656] - GenericResultAtLocation [Line: 665]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [665] - GenericResultAtLocation [Line: 736]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [736] - GenericResultAtLocation [Line: 976]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [976] * 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: 661]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1162 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1127 mSDsluCounter, 2426 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1497 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1653 IncrementalHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 929 mSDtfsCounter, 1653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1245occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 159 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 1146 SizeOfPredicates, 2 NumberOfNonLiveVariables, 763 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 131/137 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: 678]: Loop Invariant Derived loop invariant: (((((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel)) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 677]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 851]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= waterLevel))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((pumpRunning == 0) && ((((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (0 != systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= waterLevel))) || (((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (0 != systemActive))) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= waterLevel)))) - ProcedureContractResult [Line: 766]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel)) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) - ProcedureContractResult [Line: 186]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical)) && ((((((((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (1 <= waterLevel)) && (0 == systemActive)) || ((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive)) && (1 <= waterLevel))) || (((\old(methaneLevelCritical) == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)) && (1 <= waterLevel)))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 198]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: ((\result == methaneLevelCritical) && ((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel)))) - ProcedureContractResult [Line: 742]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1))) && (((((1 <= methaneLevelCritical) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((methaneLevelCritical == 0) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive)))) Ensures: ((((((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1))) && ((pumpRunning == 0) || (0 != systemActive))) && ((methaneLevelCritical < 1) || ((pumpRunning == 0) && (1 <= waterLevel)))) && ((((((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (0 == systemActive))) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 52]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 774]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((pumpRunning == 0) && ((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= waterLevel)))) Ensures: ((((((pumpRunning == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)) || (methaneLevelCritical < 1)) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((0 < methaneLevelCritical) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)))) - ProcedureContractResult [Line: 174]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= waterLevel)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (2 <= waterLevel)) && (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 <= \old(waterLevel))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 <= \old(waterLevel)))) || (((methaneLevelCritical == 0) && (2 <= \old(waterLevel))) && (0 != systemActive)))) && ((1 == systemActive) || (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2024-10-11 02:58:15,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE