./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_spec2_product59.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_spec2_product59.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 80b4c453e300455caffbcb636daccd3af095acb6ed433fb3111a61f5db77a0b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:58:54,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:58:54,661 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:54,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:58:54,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:58:54,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:58:54,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:58:54,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:58:54,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:58:54,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:58:54,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:58:54,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:58:54,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:58:54,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:58:54,720 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:58:54,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:58:54,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:58:54,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:58:54,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:58:54,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:58:54,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:58:54,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:58:54,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:58:54,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:58:54,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:58:54,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:58:54,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:58:54,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:58:54,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:58:54,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:58:54,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:58:54,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:58:54,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:54,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:58:54,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:58:54,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:58:54,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:58:54,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:58:54,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:58:54,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:58:54,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:58:54,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:58:54,745 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 -> 80b4c453e300455caffbcb636daccd3af095acb6ed433fb3111a61f5db77a0b9 [2024-10-11 02:58:54,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:58:55,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:58:55,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:58:55,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:58:55,033 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:58:55,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c [2024-10-11 02:58:56,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:58:56,787 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:58:56,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product59.cil.c [2024-10-11 02:58:56,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/642e6bd6b/6a4301f00d2d4264a390fcdd7f5291b7/FLAGc9505ceb5 [2024-10-11 02:58:56,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/642e6bd6b/6a4301f00d2d4264a390fcdd7f5291b7 [2024-10-11 02:58:56,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:58:56,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:58:56,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:56,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:58:56,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:58:56,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:56" (1/1) ... [2024-10-11 02:58:56,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1568a397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:56, skipping insertion in model container [2024-10-11 02:58:56,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:56" (1/1) ... [2024-10-11 02:58:56,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:58:57,066 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_spec2_product59.cil.c[1605,1618] [2024-10-11 02:58:57,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:57,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:58:57,239 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-10-11 02:58:57,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] [2024-10-11 02:58:57,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [300] [2024-10-11 02:58:57,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [370] [2024-10-11 02:58:57,241 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [409] [2024-10-11 02:58:57,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] [2024-10-11 02:58:57,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] [2024-10-11 02:58:57,242 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [910] [2024-10-11 02:58:57,249 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_spec2_product59.cil.c[1605,1618] [2024-10-11 02:58:57,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:57,345 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:58:57,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:57 WrapperNode [2024-10-11 02:58:57,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:57,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:57,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:58:57,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:58:57,355 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:57" (1/1) ... [2024-10-11 02:58:57,371 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:57" (1/1) ... [2024-10-11 02:58:57,401 INFO L138 Inliner]: procedures = 58, calls = 103, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 226 [2024-10-11 02:58:57,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:57,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:58:57,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:58:57,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:58:57,418 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:57" (1/1) ... [2024-10-11 02:58:57,418 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:57" (1/1) ... [2024-10-11 02:58:57,421 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:57" (1/1) ... [2024-10-11 02:58:57,444 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:57,444 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:57" (1/1) ... [2024-10-11 02:58:57,445 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:57" (1/1) ... [2024-10-11 02:58:57,457 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:57" (1/1) ... [2024-10-11 02:58:57,466 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:57" (1/1) ... [2024-10-11 02:58:57,470 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:57" (1/1) ... [2024-10-11 02:58:57,472 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:57" (1/1) ... [2024-10-11 02:58:57,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:58:57,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:58:57,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:58:57,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:58:57,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:57" (1/1) ... [2024-10-11 02:58:57,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:57,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:57,514 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:57,518 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:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:58:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:58:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:58:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:58:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:58:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:58:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:58:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:58:57,567 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:58:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:57,567 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:58:57,567 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:58:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 02:58:57,567 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 02:58:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:58:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:58:57,568 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:58:57,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:58:57,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:58:57,637 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:58:57,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:58:57,937 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-11 02:58:57,937 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:58:57,998 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:58:57,998 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:58:57,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:57 BoogieIcfgContainer [2024-10-11 02:58:57,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:58:58,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:58:58,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:58:58,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:58:58,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:58:56" (1/3) ... [2024-10-11 02:58:58,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dccf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:58, skipping insertion in model container [2024-10-11 02:58:58,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:57" (2/3) ... [2024-10-11 02:58:58,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dccf2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:58, skipping insertion in model container [2024-10-11 02:58:58,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:57" (3/3) ... [2024-10-11 02:58:58,007 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product59.cil.c [2024-10-11 02:58:58,021 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:58:58,022 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:58:58,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:58:58,083 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;@15403cd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:58:58,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:58:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 54 states have (on average 1.537037037037037) internal successors, (83), 63 states have internal predecessors, (83), 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:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:58:58,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:58,097 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:58,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:58,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1976917206, now seen corresponding path program 1 times [2024-10-11 02:58:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081203538] [2024-10-11 02:58:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:58:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,284 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:58,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081203538] [2024-10-11 02:58:58,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081203538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:58,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:58,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:58:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861814198] [2024-10-11 02:58:58,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:58,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:58:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:58:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:58,320 INFO L87 Difference]: Start difference. First operand has 78 states, 54 states have (on average 1.537037037037037) internal successors, (83), 63 states have internal predecessors, (83), 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.5) internal successors, (13), 2 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:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:58,402 INFO L93 Difference]: Finished difference Result 154 states and 223 transitions. [2024-10-11 02:58:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:58:58,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:58,417 INFO L225 Difference]: With dead ends: 154 [2024-10-11 02:58:58,417 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 02:58:58,422 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:58,425 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:58,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 02:58:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 02:58:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 59 states have internal predecessors, (73), 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:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-10-11 02:58:58,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 17 [2024-10-11 02:58:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:58,504 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-10-11 02:58:58,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-10-11 02:58:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:58:58,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:58,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:58,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:58:58,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:58,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1995793807, now seen corresponding path program 1 times [2024-10-11 02:58:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227747831] [2024-10-11 02:58:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:58:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,682 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:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227747831] [2024-10-11 02:58:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227747831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373771027] [2024-10-11 02:58:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:58,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:58,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:58,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:58,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:58,690 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:58,745 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2024-10-11 02:58:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2024-10-11 02:58:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:58,747 INFO L225 Difference]: With dead ends: 116 [2024-10-11 02:58:58,748 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 02:58:58,750 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:58,751 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:58,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 135 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 02:58:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 02:58:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 54 states have internal predecessors, (67), 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:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-10-11 02:58:58,771 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 18 [2024-10-11 02:58:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:58,772 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-10-11 02:58:58,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-10-11 02:58:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 02:58:58,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:58,773 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] [2024-10-11 02:58:58,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:58:58,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:58,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -304246320, now seen corresponding path program 1 times [2024-10-11 02:58:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136074213] [2024-10-11 02:58:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,879 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:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:58,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136074213] [2024-10-11 02:58:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136074213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:58,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:58,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896207285] [2024-10-11 02:58:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:58,884 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:58,978 INFO L93 Difference]: Finished difference Result 191 states and 264 transitions. [2024-10-11 02:58:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2024-10-11 02:58:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:58,981 INFO L225 Difference]: With dead ends: 191 [2024-10-11 02:58:58,983 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 02:58:58,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:58,985 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:58,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 161 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 02:58:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-10-11 02:58:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 103 states have internal predecessors, (129), 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:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2024-10-11 02:58:59,017 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 21 [2024-10-11 02:58:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:59,017 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2024-10-11 02:58:59,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2024-10-11 02:58:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:58:59,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:59,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:59,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:58:59,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:59,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1116358855, now seen corresponding path program 1 times [2024-10-11 02:58:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615893282] [2024-10-11 02:58:59,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:58:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,120 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:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:59,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615893282] [2024-10-11 02:58:59,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615893282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:59,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:59,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:58:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596829613] [2024-10-11 02:58:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:59,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:58:59,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:59,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:58:59,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:58:59,124 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:59,238 INFO L93 Difference]: Finished difference Result 324 states and 455 transitions. [2024-10-11 02:58:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:58:59,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2024-10-11 02:58:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:59,241 INFO L225 Difference]: With dead ends: 324 [2024-10-11 02:58:59,242 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 02:58:59,243 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:59,244 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 61 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:59,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 198 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 02:58:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2024-10-11 02:58:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.3916083916083917) internal successors, (199), 160 states have internal predecessors, (199), 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:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2024-10-11 02:58:59,269 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 24 [2024-10-11 02:58:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:59,269 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2024-10-11 02:58:59,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2024-10-11 02:58:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 02:58:59,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:59,273 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] [2024-10-11 02:58:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:58:59,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:59,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1264104213, now seen corresponding path program 1 times [2024-10-11 02:58:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:59,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250602779] [2024-10-11 02:58:59,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:58:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,389 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:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:59,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250602779] [2024-10-11 02:58:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250602779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:59,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:59,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855790913] [2024-10-11 02:58:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:59,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:59,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:59,392 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:59,555 INFO L93 Difference]: Finished difference Result 442 states and 605 transitions. [2024-10-11 02:58:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2024-10-11 02:58:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:59,559 INFO L225 Difference]: With dead ends: 442 [2024-10-11 02:58:59,559 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 02:58:59,560 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:59,561 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 50 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:59,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 201 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 02:58:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-10-11 02:58:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 175 states have (on average 1.3657142857142857) internal successors, (239), 192 states have internal predecessors, (239), 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:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2024-10-11 02:58:59,614 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 39 [2024-10-11 02:58:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:59,615 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2024-10-11 02:58:59,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:59,617 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2024-10-11 02:58:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 02:58:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:59,622 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] [2024-10-11 02:58:59,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:58:59,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1686806039, now seen corresponding path program 1 times [2024-10-11 02:58:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438569986] [2024-10-11 02:58:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:58:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:59,800 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:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438569986] [2024-10-11 02:58:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438569986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:59,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:59,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:58:59,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373937926] [2024-10-11 02:58:59,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:59,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:58:59,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:59,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:58:59,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:58:59,804 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:59:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:00,098 INFO L93 Difference]: Finished difference Result 494 states and 667 transitions. [2024-10-11 02:59:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:59:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-10-11 02:59:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:00,103 INFO L225 Difference]: With dead ends: 494 [2024-10-11 02:59:00,107 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 02:59:00,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:59:00,109 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 161 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:00,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 282 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:59:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 02:59:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2024-10-11 02:59:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 179 states have (on average 1.3575418994413408) internal successors, (243), 196 states have internal predecessors, (243), 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:59:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 325 transitions. [2024-10-11 02:59:00,146 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 325 transitions. Word has length 39 [2024-10-11 02:59:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 325 transitions. [2024-10-11 02:59:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:59:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 325 transitions. [2024-10-11 02:59:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 02:59:00,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:00,150 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] [2024-10-11 02:59:00,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:59:00,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:00,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash -118632295, now seen corresponding path program 1 times [2024-10-11 02:59:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904483596] [2024-10-11 02:59:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:59:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:59:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,234 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:59:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904483596] [2024-10-11 02:59:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904483596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:00,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:59:00,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:59:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597476409] [2024-10-11 02:59:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:00,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:59:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:00,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:59:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:59:00,236 INFO L87 Difference]: Start difference. First operand 246 states and 325 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:59:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:00,561 INFO L93 Difference]: Finished difference Result 795 states and 1121 transitions. [2024-10-11 02:59:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:59:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2024-10-11 02:59:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:00,565 INFO L225 Difference]: With dead ends: 795 [2024-10-11 02:59:00,566 INFO L226 Difference]: Without dead ends: 551 [2024-10-11 02:59:00,567 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:59:00,568 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 189 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:00,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 286 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:59:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-11 02:59:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 543. [2024-10-11 02:59:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 392 states have (on average 1.344387755102041) internal successors, (527), 423 states have internal predecessors, (527), 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:59:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 737 transitions. [2024-10-11 02:59:00,618 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 737 transitions. Word has length 39 [2024-10-11 02:59:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:00,618 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 737 transitions. [2024-10-11 02:59:00,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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:59:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 737 transitions. [2024-10-11 02:59:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 02:59:00,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:00,620 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] [2024-10-11 02:59:00,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:59:00,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:00,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash -713012557, now seen corresponding path program 1 times [2024-10-11 02:59:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291379595] [2024-10-11 02:59:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:59:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:59:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:00,740 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:59:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:00,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291379595] [2024-10-11 02:59:00,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291379595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:00,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:59:00,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:59:00,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192974891] [2024-10-11 02:59:00,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:00,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:59:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:59:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:59:00,743 INFO L87 Difference]: Start difference. First operand 543 states and 737 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:59:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:01,164 INFO L93 Difference]: Finished difference Result 1167 states and 1677 transitions. [2024-10-11 02:59:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:59:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-10-11 02:59:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:01,175 INFO L225 Difference]: With dead ends: 1167 [2024-10-11 02:59:01,175 INFO L226 Difference]: Without dead ends: 1165 [2024-10-11 02:59:01,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:59:01,177 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 279 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:01,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 150 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:59:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-10-11 02:59:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1074. [2024-10-11 02:59:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 772 states have (on average 1.3406735751295338) internal successors, (1035), 844 states have internal predecessors, (1035), 170 states have call successors, (170), 123 states have call predecessors, (170), 131 states have return successors, (351), 147 states have call predecessors, (351), 170 states have call successors, (351) [2024-10-11 02:59:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1556 transitions. [2024-10-11 02:59:01,299 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1556 transitions. Word has length 43 [2024-10-11 02:59:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:01,299 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1556 transitions. [2024-10-11 02:59:01,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:59:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1556 transitions. [2024-10-11 02:59:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:59:01,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:01,304 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:59:01,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:59:01,305 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash 77102931, now seen corresponding path program 1 times [2024-10-11 02:59:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655228276] [2024-10-11 02:59:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:01,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:59:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:59:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:59:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:59:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 02:59:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655228276] [2024-10-11 02:59:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655228276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:01,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:59:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:59:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355036486] [2024-10-11 02:59:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:01,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:59:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:01,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:59:01,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:59:01,429 INFO L87 Difference]: Start difference. First operand 1074 states and 1556 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 02:59:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:01,829 INFO L93 Difference]: Finished difference Result 1200 states and 1726 transitions. [2024-10-11 02:59:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:59:01,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 68 [2024-10-11 02:59:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:01,835 INFO L225 Difference]: With dead ends: 1200 [2024-10-11 02:59:01,835 INFO L226 Difference]: Without dead ends: 522 [2024-10-11 02:59:01,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:59:01,840 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 293 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:01,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 206 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:59:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-11 02:59:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 509. [2024-10-11 02:59:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 371 states have (on average 1.2991913746630728) internal successors, (482), 399 states have internal predecessors, (482), 75 states have call successors, (75), 57 states have call predecessors, (75), 62 states have return successors, (161), 70 states have call predecessors, (161), 75 states have call successors, (161) [2024-10-11 02:59:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 718 transitions. [2024-10-11 02:59:01,891 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 718 transitions. Word has length 68 [2024-10-11 02:59:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 718 transitions. [2024-10-11 02:59:01,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 02:59:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 718 transitions. [2024-10-11 02:59:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 02:59:01,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:01,894 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:59:01,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:59:01,895 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:01,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:01,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1766695239, now seen corresponding path program 1 times [2024-10-11 02:59:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825623713] [2024-10-11 02:59:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:59:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:59:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:59:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:59:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:59:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:59:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 02:59:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825623713] [2024-10-11 02:59:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825623713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:59:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653462313] [2024-10-11 02:59:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:02,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:59:02,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:59:02,014 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:59:02,015 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:59:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:59:02,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:59:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 02:59:02,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:59:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653462313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:02,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:59:02,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 02:59:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102913296] [2024-10-11 02:59:02,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:59:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:59:02,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:59:02,197 INFO L87 Difference]: Start difference. First operand 509 states and 718 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:59:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:02,276 INFO L93 Difference]: Finished difference Result 1028 states and 1494 transitions. [2024-10-11 02:59:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:59:02,277 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-10-11 02:59:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:02,283 INFO L225 Difference]: With dead ends: 1028 [2024-10-11 02:59:02,283 INFO L226 Difference]: Without dead ends: 521 [2024-10-11 02:59:02,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:59:02,287 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:02,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:59:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-11 02:59:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2024-10-11 02:59:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 377 states have (on average 1.2944297082228118) internal successors, (488), 405 states have internal predecessors, (488), 75 states have call successors, (75), 57 states have call predecessors, (75), 62 states have return successors, (161), 70 states have call predecessors, (161), 75 states have call successors, (161) [2024-10-11 02:59:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 724 transitions. [2024-10-11 02:59:02,347 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 724 transitions. Word has length 78 [2024-10-11 02:59:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 724 transitions. [2024-10-11 02:59:02,348 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 02:59:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 724 transitions. [2024-10-11 02:59:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 02:59:02,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:02,350 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:59:02,368 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:59:02,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:59:02,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:02,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2105570231, now seen corresponding path program 1 times [2024-10-11 02:59:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257138999] [2024-10-11 02:59:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:02,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:59:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:59:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:59:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:59:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:59:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:59:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 02:59:02,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257138999] [2024-10-11 02:59:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257138999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:59:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241178832] [2024-10-11 02:59:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:02,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:59:02,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:59:02,760 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:59:02,761 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:59:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:59:02,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:59:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:59:02,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:59:02,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241178832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:02,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:59:02,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-11 02:59:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030898715] [2024-10-11 02:59:02,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:02,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:59:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:59:02,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:59:02,983 INFO L87 Difference]: Start difference. First operand 515 states and 724 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:59:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:03,090 INFO L93 Difference]: Finished difference Result 814 states and 1129 transitions. [2024-10-11 02:59:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:59:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 78 [2024-10-11 02:59:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:03,093 INFO L225 Difference]: With dead ends: 814 [2024-10-11 02:59:03,093 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 02:59:03,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:59:03,097 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 87 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:03,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 222 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:59:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 02:59:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2024-10-11 02:59:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 223 states have internal predecessors, (256), 39 states have call successors, (39), 31 states have call predecessors, (39), 35 states have return successors, (67), 39 states have call predecessors, (67), 39 states have call successors, (67) [2024-10-11 02:59:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 362 transitions. [2024-10-11 02:59:03,118 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 362 transitions. Word has length 78 [2024-10-11 02:59:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:03,119 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 362 transitions. [2024-10-11 02:59:03,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:59:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 362 transitions. [2024-10-11 02:59:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 02:59:03,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:03,121 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:59:03,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:59:03,322 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:59:03,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:03,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1077492596, now seen corresponding path program 1 times [2024-10-11 02:59:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136438415] [2024-10-11 02:59:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:59:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:59:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:59:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:59:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:59:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:59:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:59:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136438415] [2024-10-11 02:59:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136438415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:59:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329840613] [2024-10-11 02:59:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:03,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:59:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:59:03,467 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:59:03,468 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:59:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:59:03,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:59:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:59:03,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:59:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329840613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:59:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-10-11 02:59:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693687449] [2024-10-11 02:59:03,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:59:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:03,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:59:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:59:03,620 INFO L87 Difference]: Start difference. First operand 283 states and 362 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:59:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:03,669 INFO L93 Difference]: Finished difference Result 473 states and 611 transitions. [2024-10-11 02:59:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:59:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-10-11 02:59:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:03,670 INFO L225 Difference]: With dead ends: 473 [2024-10-11 02:59:03,671 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:59:03,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:59:03,673 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:03,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 140 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:59:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:59:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:59:03,674 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:59:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:59:03,675 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2024-10-11 02:59:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:03,675 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:59:03,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:59:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:59:03,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:59:03,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:59:03,696 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:59:03,879 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:59:03,882 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:59:03,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:59:06,221 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:59:06,239 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0))) Eliminated clause: (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0)) [2024-10-11 02:59:06,253 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (= |old(~methAndRunningLastTime~0)| ~methAndRunningLastTime~0) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse1 (= 1 ~systemActive~0))) (or (and .cse0 (= 0 ~systemActive~0)) (and (= |old(~methAndRunningLastTime~0)| 0) .cse1 .cse0 (<= 1 |old(~waterLevel~0)|)) (and .cse1 (<= 2 |old(~waterLevel~0)|) (<= 1 |old(~pumpRunning~0)|))))) Eliminated clause: (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 (= ~methAndRunningLastTime~0 0) .cse1 (<= 1 ~waterLevel~0)) (and (<= 1 ~pumpRunning~0) (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 0 ~systemActive~0)))) [2024-10-11 02:59:06,274 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= ~methAndRunningLastTime~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= ~methAndRunningLastTime~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 02:59:06,280 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 (<= 1 |old(~waterLevel~0)|)) (and .cse0 .cse1 (= 0 ~systemActive~0)) (and (<= 1 ~pumpRunning~0) .cse2 (<= 2 |old(~waterLevel~0)|)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse2 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0))) (or (and .cse0 .cse1 .cse2 (<= 1 ~waterLevel~0)) (and (<= 1 ~pumpRunning~0) (<= 2 ~waterLevel~0) .cse2) (and .cse0 .cse1 (= 0 ~systemActive~0)))) [2024-10-11 02:59:06,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:59:06 BoogieIcfgContainer [2024-10-11 02:59:06,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:59:06,286 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:59:06,286 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:59:06,286 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:59:06,287 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:57" (3/4) ... [2024-10-11 02:59:06,289 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 02:59:06,292 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-11 02:59:06,292 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 02:59:06,292 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 02:59:06,292 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 02:59:06,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-11 02:59:06,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 02:59:06,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:59:06,293 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 02:59:06,301 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2024-10-11 02:59:06,301 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 02:59:06,301 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 02:59:06,302 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:59:06,302 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:59:06,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:59:06,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 02:59:06,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:59:06,413 INFO L158 Benchmark]: Toolchain (without parser) took 9585.13ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 130.7MB in the beginning and 143.5MB in the end (delta: -12.9MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,413 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:59:06,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.88ms. Allocated memory is still 184.5MB. Free memory was 130.7MB in the beginning and 108.9MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.41ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,414 INFO L158 Benchmark]: Boogie Preprocessor took 74.80ms. Allocated memory is still 184.5MB. Free memory was 106.8MB in the beginning and 104.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,414 INFO L158 Benchmark]: RCFGBuilder took 520.02ms. Allocated memory is still 184.5MB. Free memory was 104.2MB in the beginning and 79.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,414 INFO L158 Benchmark]: TraceAbstraction took 8284.54ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 78.3MB in the beginning and 151.9MB in the end (delta: -73.7MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,414 INFO L158 Benchmark]: Witness Printer took 126.52ms. Allocated memory is still 310.4MB. Free memory was 151.9MB in the beginning and 143.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 02:59:06,416 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.20ms. Allocated memory is still 184.5MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.88ms. Allocated memory is still 184.5MB. Free memory was 130.7MB in the beginning and 108.9MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.41ms. Allocated memory is still 184.5MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.80ms. Allocated memory is still 184.5MB. Free memory was 106.8MB in the beginning and 104.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 520.02ms. Allocated memory is still 184.5MB. Free memory was 104.2MB in the beginning and 79.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8284.54ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 78.3MB in the beginning and 151.9MB in the end (delta: -73.7MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. * Witness Printer took 126.52ms. Allocated memory is still 310.4MB. Free memory was 151.9MB in the beginning and 143.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [58] - GenericResultAtLocation [Line: 300]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [300] - GenericResultAtLocation [Line: 370]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [370] - GenericResultAtLocation [Line: 409]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [409] - GenericResultAtLocation [Line: 509]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] - GenericResultAtLocation [Line: 544]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] - GenericResultAtLocation [Line: 910]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [910] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 54]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1267 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1234 mSDsluCounter, 2273 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1311 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1187 IncrementalHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 962 mSDtfsCounter, 1187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1074occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 150 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 767 ConstructedInterpolants, 0 QuantifiedInterpolants, 1263 SizeOfPredicates, 3 NumberOfNonLiveVariables, 876 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 216/230 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: 421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 313]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: ((((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) - ProcedureContractResult [Line: 183]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive)) Ensures: ((pumpRunning == 0) && (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive))) - ProcedureContractResult [Line: 98]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) - ProcedureContractResult [Line: 938]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (0 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (0 == systemActive))) - ProcedureContractResult [Line: 411]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 950]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) - ProcedureContractResult [Line: 74]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((((((((\old(methAndRunningLastTime) == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))) || (0 == systemActive)) || (((1 == systemActive) && (2 <= \old(waterLevel))) && (1 <= \old(pumpRunning)))) && (((((\old(pumpRunning) != 0) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel))) || (\old(waterLevel) < 2)) || (0 == systemActive)) || ((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel)))) && ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= waterLevel)) || (\old(pumpRunning) < 1))) && (((((\old(pumpRunning) != 0) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (waterLevel == 1))) || (0 == systemActive)) || ((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel)))) && (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(pumpRunning) == 0)) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) - ProcedureContractResult [Line: 106]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: (((((methAndRunningLastTime == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)) && ((0 < pumpRunning) || (pumpRunning == 0))) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) - ProcedureContractResult [Line: 926]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (0 == systemActive))) Ensures: ((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (((2 <= waterLevel) && (1 == systemActive)) || (0 == systemActive))) && (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(waterLevel))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (0 == systemActive))) || (((1 <= pumpRunning) && (1 == systemActive)) && (2 <= \old(waterLevel))))) RESULT: Ultimate proved your program to be correct! [2024-10-11 02:59:06,450 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