./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 458689bcd0930e2b07a61b7490d83be8ce4e59412b26a60581bf78c492ee412e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:54:15,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:54:16,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:54:16,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:54:16,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:54:16,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:54:16,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:54:16,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:54:16,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:54:16,073 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:54:16,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:54:16,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:54:16,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:54:16,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:54:16,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:54:16,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:54:16,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:54:16,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:54:16,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:54:16,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:54:16,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:54:16,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:54:16,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:54:16,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:54:16,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:54:16,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:54:16,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:54:16,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:54:16,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:54:16,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:54:16,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:54:16,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:54:16,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:16,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:54:16,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:54:16,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:54:16,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:54:16,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:54:16,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:54:16,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:54:16,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:54:16,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:54:16,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 458689bcd0930e2b07a61b7490d83be8ce4e59412b26a60581bf78c492ee412e [2024-11-11 20:54:16,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:54:16,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:54:16,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:54:16,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:54:16,394 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:54:16,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c [2024-11-11 20:54:17,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:54:17,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:54:17,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c [2024-11-11 20:54:17,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c370ecce/20849d80698845aea144c91bd2ed0055/FLAG1b625f32c [2024-11-11 20:54:18,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c370ecce/20849d80698845aea144c91bd2ed0055 [2024-11-11 20:54:18,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:54:18,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:54:18,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:18,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:54:18,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:54:18,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b67084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18, skipping insertion in model container [2024-11-11 20:54:18,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:54:18,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c[18431,18444] [2024-11-11 20:54:18,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:18,612 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:54:18,619 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [49] [2024-11-11 20:54:18,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [87] [2024-11-11 20:54:18,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [125] [2024-11-11 20:54:18,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [491] [2024-11-11 20:54:18,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [592] [2024-11-11 20:54:18,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [689] [2024-11-11 20:54:18,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [895] [2024-11-11 20:54:18,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [962] [2024-11-11 20:54:18,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product46.cil.c[18431,18444] [2024-11-11 20:54:18,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:54:18,708 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:54:18,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18 WrapperNode [2024-11-11 20:54:18,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:54:18,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:18,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:54:18,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:54:18,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,758 INFO L138 Inliner]: procedures = 55, calls = 101, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 200 [2024-11-11 20:54:18,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:54:18,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:54:18,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:54:18,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:54:18,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,781 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:54:18,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:54:18,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:54:18,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:54:18,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:54:18,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (1/1) ... [2024-11-11 20:54:18,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:54:18,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:18,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:54:18,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:54:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:54:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:54:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:54:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:54:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:54:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:54:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:54:18,875 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-11 20:54:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-11 20:54:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:54:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:54:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:54:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:54:18,876 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-11 20:54:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-11 20:54:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:54:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:54:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:54:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:54:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:54:18,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:54:18,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:54:19,183 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-11 20:54:19,184 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:54:19,197 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:54:19,197 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:54:19,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:19 BoogieIcfgContainer [2024-11-11 20:54:19,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:54:19,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:54:19,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:54:19,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:54:19,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:54:18" (1/3) ... [2024-11-11 20:54:19,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15463931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:54:19, skipping insertion in model container [2024-11-11 20:54:19,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:54:18" (2/3) ... [2024-11-11 20:54:19,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15463931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:54:19, skipping insertion in model container [2024-11-11 20:54:19,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:19" (3/3) ... [2024-11-11 20:54:19,205 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product46.cil.c [2024-11-11 20:54:19,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:54:19,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:54:19,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:54:19,271 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;@3d21117d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:54:19,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:54:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 72 states have (on average 1.375) internal successors, (99), 80 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 20:54:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:54:19,289 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:19,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:19,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1887688965, now seen corresponding path program 1 times [2024-11-11 20:54:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657689890] [2024-11-11 20:54:19,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 20:54:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657689890] [2024-11-11 20:54:19,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657689890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:19,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:19,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:54:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946119314] [2024-11-11 20:54:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:19,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:54:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:54:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:54:19,463 INFO L87 Difference]: Start difference. First operand has 96 states, 72 states have (on average 1.375) internal successors, (99), 80 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:19,486 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2024-11-11 20:54:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:54:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-11 20:54:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:19,502 INFO L225 Difference]: With dead ends: 184 [2024-11-11 20:54:19,503 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 20:54:19,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:54:19,508 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:19,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 20:54:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-11 20:54:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 72 states have internal predecessors, (85), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:54:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-11 20:54:19,544 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 25 [2024-11-11 20:54:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:19,544 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-11 20:54:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-11 20:54:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 20:54:19,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:19,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:19,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:54:19,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2062523597, now seen corresponding path program 1 times [2024-11-11 20:54:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221524641] [2024-11-11 20:54:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:54:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221524641] [2024-11-11 20:54:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221524641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:19,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:54:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968045008] [2024-11-11 20:54:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:19,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:54:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:54:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:19,651 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:19,672 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2024-11-11 20:54:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:54:19,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-11 20:54:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:19,675 INFO L225 Difference]: With dead ends: 139 [2024-11-11 20:54:19,675 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 20:54:19,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:54:19,677 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:19,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 181 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:54:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 20:54:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-11 20:54:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 66 states have internal predecessors, (78), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:54:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-11 20:54:19,688 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 26 [2024-11-11 20:54:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:19,688 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-11 20:54:19,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-11 20:54:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 20:54:19,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:19,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:19,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:54:19,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:19,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash -89675643, now seen corresponding path program 1 times [2024-11-11 20:54:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619587693] [2024-11-11 20:54:19,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619587693] [2024-11-11 20:54:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619587693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:19,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:19,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:19,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721744566] [2024-11-11 20:54:19,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:19,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:19,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:19,908 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:20,055 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2024-11-11 20:54:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:54:20,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-11 20:54:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:20,056 INFO L225 Difference]: With dead ends: 149 [2024-11-11 20:54:20,057 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 20:54:20,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:54:20,058 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 156 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:20,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 238 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 20:54:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-11 20:54:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.305084745762712) internal successors, (77), 66 states have internal predecessors, (77), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:54:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2024-11-11 20:54:20,066 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 31 [2024-11-11 20:54:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:20,066 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2024-11-11 20:54:20,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:54:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2024-11-11 20:54:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 20:54:20,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:20,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:20,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:54:20,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:20,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash -106405387, now seen corresponding path program 1 times [2024-11-11 20:54:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112032043] [2024-11-11 20:54:20,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:20,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:54:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:54:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:20,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112032043] [2024-11-11 20:54:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112032043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:20,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:20,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:54:20,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637299782] [2024-11-11 20:54:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:54:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:20,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:54:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:54:20,206 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:54:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:20,442 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2024-11-11 20:54:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:20,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2024-11-11 20:54:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:20,444 INFO L225 Difference]: With dead ends: 233 [2024-11-11 20:54:20,447 INFO L226 Difference]: Without dead ends: 162 [2024-11-11 20:54:20,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:54:20,449 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 187 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:20,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 289 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-11 20:54:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2024-11-11 20:54:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 127 states have internal predecessors, (150), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-11 20:54:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2024-11-11 20:54:20,470 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 41 [2024-11-11 20:54:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:20,471 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2024-11-11 20:54:20,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 20:54:20,471 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2024-11-11 20:54:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 20:54:20,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:20,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:20,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:54:20,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -822814067, now seen corresponding path program 1 times [2024-11-11 20:54:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505662769] [2024-11-11 20:54:20,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:54:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505662769] [2024-11-11 20:54:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505662769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:20,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:20,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182542880] [2024-11-11 20:54:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:20,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:20,605 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:20,827 INFO L93 Difference]: Finished difference Result 399 states and 507 transitions. [2024-11-11 20:54:20,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:20,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-11 20:54:20,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:20,831 INFO L225 Difference]: With dead ends: 399 [2024-11-11 20:54:20,831 INFO L226 Difference]: Without dead ends: 250 [2024-11-11 20:54:20,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:20,833 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 134 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:20,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 327 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-11 20:54:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-11-11 20:54:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 200 states have internal predecessors, (236), 30 states have call successors, (30), 26 states have call predecessors, (30), 28 states have return successors, (40), 30 states have call predecessors, (40), 30 states have call successors, (40) [2024-11-11 20:54:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2024-11-11 20:54:20,879 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 47 [2024-11-11 20:54:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2024-11-11 20:54:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:54:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2024-11-11 20:54:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:54:20,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:20,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:54:20,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 688456935, now seen corresponding path program 1 times [2024-11-11 20:54:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937566149] [2024-11-11 20:54:20,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:54:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:54:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:21,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:21,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937566149] [2024-11-11 20:54:21,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937566149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:21,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:21,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:54:21,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172531545] [2024-11-11 20:54:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:21,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:54:21,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:21,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:54:21,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:54:21,026 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:54:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:21,410 INFO L93 Difference]: Finished difference Result 570 states and 729 transitions. [2024-11-11 20:54:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:54:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2024-11-11 20:54:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:21,413 INFO L225 Difference]: With dead ends: 570 [2024-11-11 20:54:21,414 INFO L226 Difference]: Without dead ends: 421 [2024-11-11 20:54:21,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:54:21,415 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 360 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:21,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 305 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:54:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-11 20:54:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2024-11-11 20:54:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 332 states have internal predecessors, (382), 50 states have call successors, (50), 39 states have call predecessors, (50), 48 states have return successors, (77), 51 states have call predecessors, (77), 50 states have call successors, (77) [2024-11-11 20:54:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 509 transitions. [2024-11-11 20:54:21,457 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 509 transitions. Word has length 51 [2024-11-11 20:54:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:21,457 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 509 transitions. [2024-11-11 20:54:21,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:54:21,458 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 509 transitions. [2024-11-11 20:54:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:54:21,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:21,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:21,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:54:21,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:21,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 554443429, now seen corresponding path program 1 times [2024-11-11 20:54:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527505132] [2024-11-11 20:54:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:54:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:54:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527505132] [2024-11-11 20:54:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527505132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:54:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689267480] [2024-11-11 20:54:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:21,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:54:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:21,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:54:21,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:54:21,531 INFO L87 Difference]: Start difference. First operand 411 states and 509 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:54:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:21,713 INFO L93 Difference]: Finished difference Result 733 states and 911 transitions. [2024-11-11 20:54:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:54:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-11 20:54:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:21,715 INFO L225 Difference]: With dead ends: 733 [2024-11-11 20:54:21,715 INFO L226 Difference]: Without dead ends: 417 [2024-11-11 20:54:21,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:54:21,717 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 125 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:21,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 287 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-11 20:54:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2024-11-11 20:54:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 312 states have (on average 1.2211538461538463) internal successors, (381), 332 states have internal predecessors, (381), 50 states have call successors, (50), 39 states have call predecessors, (50), 48 states have return successors, (77), 51 states have call predecessors, (77), 50 states have call successors, (77) [2024-11-11 20:54:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 508 transitions. [2024-11-11 20:54:21,756 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 508 transitions. Word has length 51 [2024-11-11 20:54:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:21,757 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 508 transitions. [2024-11-11 20:54:21,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:54:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 508 transitions. [2024-11-11 20:54:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:54:21,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:21,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:54:21,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash 773298147, now seen corresponding path program 1 times [2024-11-11 20:54:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155862874] [2024-11-11 20:54:21,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:54:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:54:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:54:21,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155862874] [2024-11-11 20:54:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155862874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:21,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:54:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334032425] [2024-11-11 20:54:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:54:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:21,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:54:21,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:21,825 INFO L87 Difference]: Start difference. First operand 411 states and 508 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:54:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:22,029 INFO L93 Difference]: Finished difference Result 824 states and 1029 transitions. [2024-11-11 20:54:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:54:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-11 20:54:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:22,032 INFO L225 Difference]: With dead ends: 824 [2024-11-11 20:54:22,032 INFO L226 Difference]: Without dead ends: 420 [2024-11-11 20:54:22,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:22,034 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 125 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:22,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 353 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:54:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-11 20:54:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 414. [2024-11-11 20:54:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 317 states have (on average 1.2145110410094637) internal successors, (385), 336 states have internal predecessors, (385), 49 states have call successors, (49), 38 states have call predecessors, (49), 47 states have return successors, (76), 50 states have call predecessors, (76), 49 states have call successors, (76) [2024-11-11 20:54:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 510 transitions. [2024-11-11 20:54:22,055 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 510 transitions. Word has length 51 [2024-11-11 20:54:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:22,056 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 510 transitions. [2024-11-11 20:54:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 20:54:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 510 transitions. [2024-11-11 20:54:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 20:54:22,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:22,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:22,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:54:22,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:22,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 271087281, now seen corresponding path program 1 times [2024-11-11 20:54:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55817770] [2024-11-11 20:54:22,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:54:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:54:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:54:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:22,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55817770] [2024-11-11 20:54:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55817770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:54:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948233396] [2024-11-11 20:54:22,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:22,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:54:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:54:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:54:22,202 INFO L87 Difference]: Start difference. First operand 414 states and 510 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 20:54:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:22,882 INFO L93 Difference]: Finished difference Result 1181 states and 1513 transitions. [2024-11-11 20:54:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 20:54:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-11-11 20:54:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:22,886 INFO L225 Difference]: With dead ends: 1181 [2024-11-11 20:54:22,886 INFO L226 Difference]: Without dead ends: 774 [2024-11-11 20:54:22,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2024-11-11 20:54:22,888 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 185 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:22,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 931 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:54:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-11 20:54:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 770. [2024-11-11 20:54:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 580 states have (on average 1.1844827586206896) internal successors, (687), 614 states have internal predecessors, (687), 97 states have call successors, (97), 76 states have call predecessors, (97), 92 states have return successors, (166), 98 states have call predecessors, (166), 97 states have call successors, (166) [2024-11-11 20:54:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 950 transitions. [2024-11-11 20:54:22,924 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 950 transitions. Word has length 60 [2024-11-11 20:54:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:22,924 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 950 transitions. [2024-11-11 20:54:22,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 20:54:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 950 transitions. [2024-11-11 20:54:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 20:54:22,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:22,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:22,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:54:22,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash -907258435, now seen corresponding path program 1 times [2024-11-11 20:54:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740890941] [2024-11-11 20:54:22,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:54:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:54:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:54:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740890941] [2024-11-11 20:54:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740890941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:54:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588745800] [2024-11-11 20:54:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:54:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:22,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:54:22,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:54:22,996 INFO L87 Difference]: Start difference. First operand 770 states and 950 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 20:54:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:23,298 INFO L93 Difference]: Finished difference Result 1533 states and 1893 transitions. [2024-11-11 20:54:23,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 20:54:23,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-11-11 20:54:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:23,301 INFO L225 Difference]: With dead ends: 1533 [2024-11-11 20:54:23,302 INFO L226 Difference]: Without dead ends: 770 [2024-11-11 20:54:23,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:54:23,304 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 188 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 449 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-11 20:54:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2024-11-11 20:54:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 580 states have (on average 1.1706896551724137) internal successors, (679), 614 states have internal predecessors, (679), 97 states have call successors, (97), 76 states have call predecessors, (97), 92 states have return successors, (147), 98 states have call predecessors, (147), 97 states have call successors, (147) [2024-11-11 20:54:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 923 transitions. [2024-11-11 20:54:23,337 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 923 transitions. Word has length 61 [2024-11-11 20:54:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:23,337 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 923 transitions. [2024-11-11 20:54:23,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 20:54:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 923 transitions. [2024-11-11 20:54:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:54:23,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:23,340 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:54:23,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2101060045, now seen corresponding path program 1 times [2024-11-11 20:54:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910527990] [2024-11-11 20:54:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:54:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:54:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:54:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:54:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:54:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:54:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:23,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910527990] [2024-11-11 20:54:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910527990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:23,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:23,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:54:23,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694010484] [2024-11-11 20:54:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:54:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:54:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:54:23,436 INFO L87 Difference]: Start difference. First operand 770 states and 923 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:54:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:23,666 INFO L93 Difference]: Finished difference Result 1533 states and 1863 transitions. [2024-11-11 20:54:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:54:23,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2024-11-11 20:54:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:23,669 INFO L225 Difference]: With dead ends: 1533 [2024-11-11 20:54:23,669 INFO L226 Difference]: Without dead ends: 770 [2024-11-11 20:54:23,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:23,677 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 126 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:23,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 354 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-11 20:54:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2024-11-11 20:54:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 580 states have (on average 1.1637931034482758) internal successors, (675), 614 states have internal predecessors, (675), 97 states have call successors, (97), 76 states have call predecessors, (97), 92 states have return successors, (147), 98 states have call predecessors, (147), 97 states have call successors, (147) [2024-11-11 20:54:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 919 transitions. [2024-11-11 20:54:23,735 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 919 transitions. Word has length 99 [2024-11-11 20:54:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:23,735 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 919 transitions. [2024-11-11 20:54:23,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:54:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 919 transitions. [2024-11-11 20:54:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:54:23,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:23,740 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:23,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:54:23,740 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:23,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1306684405, now seen corresponding path program 1 times [2024-11-11 20:54:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145141907] [2024-11-11 20:54:23,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 20:54:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:54:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:54:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:54:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:54:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:54:23,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:23,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145141907] [2024-11-11 20:54:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145141907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:54:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:54:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:54:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46375653] [2024-11-11 20:54:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:54:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:54:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:23,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:54:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:54:23,908 INFO L87 Difference]: Start difference. First operand 770 states and 919 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:54:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:24,168 INFO L93 Difference]: Finished difference Result 1389 states and 1677 transitions. [2024-11-11 20:54:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:54:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2024-11-11 20:54:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:24,171 INFO L225 Difference]: With dead ends: 1389 [2024-11-11 20:54:24,171 INFO L226 Difference]: Without dead ends: 626 [2024-11-11 20:54:24,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:54:24,172 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:24,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 366 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:54:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-11 20:54:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2024-11-11 20:54:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 470 states have (on average 1.1617021276595745) internal successors, (546), 498 states have internal predecessors, (546), 81 states have call successors, (81), 64 states have call predecessors, (81), 74 states have return successors, (110), 78 states have call predecessors, (110), 81 states have call successors, (110) [2024-11-11 20:54:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 737 transitions. [2024-11-11 20:54:24,195 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 737 transitions. Word has length 99 [2024-11-11 20:54:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 737 transitions. [2024-11-11 20:54:24,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 20:54:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 737 transitions. [2024-11-11 20:54:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:54:24,197 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:54:24,197 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:24,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:54:24,197 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:54:24,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:54:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1686740425, now seen corresponding path program 1 times [2024-11-11 20:54:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:54:24,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980470220] [2024-11-11 20:54:24,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:24,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:54:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:54:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:54:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:54:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:54:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 20:54:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:54:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:54:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:54:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:54:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:54:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980470220] [2024-11-11 20:54:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980470220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:54:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899503163] [2024-11-11 20:54:24,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:54:24,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:54:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:54:24,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:54:24,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:54:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:54:24,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 20:54:24,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:54:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 20:54:24,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:54:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-11 20:54:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899503163] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:54:24,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:54:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 22 [2024-11-11 20:54:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005160954] [2024-11-11 20:54:24,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:54:24,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 20:54:24,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:54:24,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 20:54:24,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-11 20:54:24,971 INFO L87 Difference]: Start difference. First operand 626 states and 737 transitions. Second operand has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 7 states have call successors, (23) [2024-11-11 20:54:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:54:26,160 INFO L93 Difference]: Finished difference Result 1323 states and 1610 transitions. [2024-11-11 20:54:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-11 20:54:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 7 states have call successors, (23) Word has length 99 [2024-11-11 20:54:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:54:26,162 INFO L225 Difference]: With dead ends: 1323 [2024-11-11 20:54:26,162 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 20:54:26,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 207 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1072, Invalid=3898, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 20:54:26,166 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 733 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:54:26,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 597 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 20:54:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 20:54:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 20:54:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 20:54:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 20:54:26,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-11-11 20:54:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:54:26,169 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 20:54:26,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.454545454545454) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 7 states have call successors, (23) [2024-11-11 20:54:26,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 20:54:26,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 20:54:26,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:54:26,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:54:26,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 20:54:26,375 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:54:26,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 20:54:28,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:54:28,949 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= |old(~methaneLevelCritical~0)| 0)) (.cse1 (= ~methaneLevelCritical~0 0))) (and (or .cse0 (not .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse3 (<= ~waterLevel~0 2))) (or (and .cse2 .cse3 (= ~pumpRunning~0 1)) (and (= ~pumpRunning~0 0) .cse2 .cse3))) (or (not .cse0) .cse1))) Eliminated clause: (and (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= ~waterLevel~0 2))) (or (and .cse0 .cse1 (= ~pumpRunning~0 1)) (and (= ~pumpRunning~0 0) .cse0 .cse1))) (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0)) (.cse3 (= ~methaneLevelCritical~0 0))) (and (or .cse2 (not .cse3)) (or (not .cse2) .cse3))))) [2024-11-11 20:54:28,953 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:28,956 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 2))) (or (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 2))) (or (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1)))))) [2024-11-11 20:54:28,969 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:28,985 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse4 (= ~methaneLevelCritical~0 0)) (.cse2 (= ~pumpRunning~0 1))) (and (let ((.cse3 (= ~pumpRunning~0 0)) (.cse0 (= 1 ~systemActive~0)) (.cse1 (<= |old(~waterLevel~0)| 2))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= |old(~waterLevel~0)| 1)) (and .cse3 .cse0 (not .cse4) .cse1))) (or .cse4 (<= ~waterLevel~0 1) (not .cse2)) (= |old(~waterLevel~0)| ~waterLevel~0))) Eliminated clause: (let ((.cse1 (= ~pumpRunning~0 1)) (.cse0 (= ~methaneLevelCritical~0 0))) (and (or .cse0 (not .cse1) (< ~waterLevel~0 2)) (let ((.cse4 (= ~pumpRunning~0 0)) (.cse2 (= 1 ~systemActive~0)) (.cse3 (<= ~waterLevel~0 2))) (or (and .cse2 .cse3 .cse1) (and .cse4 (<= ~waterLevel~0 1) .cse2) (and .cse4 .cse2 (not .cse0) .cse3))))) [2024-11-11 20:54:28,996 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__methaneQuery contained old-variable. Original clause: (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1)))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int)) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1))))) [2024-11-11 20:54:29,000 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-11 20:54:29,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:54:29 BoogieIcfgContainer [2024-11-11 20:54:29,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:54:29,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:54:29,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:54:29,008 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:54:29,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:54:19" (3/4) ... [2024-11-11 20:54:29,013 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 20:54:29,016 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-11 20:54:29,016 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-11 20:54:29,016 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-11 20:54:29,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-11 20:54:29,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-11 20:54:29,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-11 20:54:29,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:54:29,019 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2024-11-11 20:54:29,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-11 20:54:29,027 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-11 20:54:29,027 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-11 20:54:29,027 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:29,028 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 20:54:29,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:54:29,214 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 20:54:29,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:54:29,215 INFO L158 Benchmark]: Toolchain (without parser) took 10982.17ms. Allocated memory was 176.2MB in the beginning and 270.5MB in the end (delta: 94.4MB). Free memory was 98.2MB in the beginning and 191.0MB in the end (delta: -92.8MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,218 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 144.6MB in the end (delta: 260.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:54:29,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.75ms. Allocated memory is still 176.2MB. Free memory was 97.9MB in the beginning and 136.3MB in the end (delta: -38.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.60ms. Allocated memory is still 176.2MB. Free memory was 136.3MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,219 INFO L158 Benchmark]: Boogie Preprocessor took 37.25ms. Allocated memory is still 176.2MB. Free memory was 134.3MB in the beginning and 131.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,219 INFO L158 Benchmark]: RCFGBuilder took 401.09ms. Allocated memory is still 176.2MB. Free memory was 131.4MB in the beginning and 113.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,223 INFO L158 Benchmark]: TraceAbstraction took 9807.87ms. Allocated memory was 176.2MB in the beginning and 270.5MB in the end (delta: 94.4MB). Free memory was 112.5MB in the beginning and 199.4MB in the end (delta: -86.8MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,223 INFO L158 Benchmark]: Witness Printer took 206.44ms. Allocated memory is still 270.5MB. Free memory was 199.4MB in the beginning and 191.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 20:54:29,225 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.11ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 144.6MB in the end (delta: 260.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 472.75ms. Allocated memory is still 176.2MB. Free memory was 97.9MB in the beginning and 136.3MB in the end (delta: -38.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.60ms. Allocated memory is still 176.2MB. Free memory was 136.3MB in the beginning and 134.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.25ms. Allocated memory is still 176.2MB. Free memory was 134.3MB in the beginning and 131.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 401.09ms. Allocated memory is still 176.2MB. Free memory was 131.4MB in the beginning and 113.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9807.87ms. Allocated memory was 176.2MB in the beginning and 270.5MB in the end (delta: 94.4MB). Free memory was 112.5MB in the beginning and 199.4MB in the end (delta: -86.8MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 206.44ms. Allocated memory is still 270.5MB. Free memory was 199.4MB in the beginning and 191.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [87] - GenericResultAtLocation [Line: 125]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [125] - GenericResultAtLocation [Line: 491]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [491] - GenericResultAtLocation [Line: 592]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [592] - GenericResultAtLocation [Line: 689]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [689] - GenericResultAtLocation [Line: 895]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [895] - GenericResultAtLocation [Line: 962]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [962] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 967]: 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, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2515 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2463 mSDsluCounter, 4798 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3697 mSDsCounter, 812 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3987 IncrementalHoareTripleChecker+Invalid, 4799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 812 mSolverCounterUnsat, 1101 mSDtfsCounter, 3987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 526 GetRequests, 333 SyntacticMatches, 7 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=9, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 924 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 2 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 184/211 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: 906]: Loop Invariant Derived loop invariant: ((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical != 0)) && (splverifierCounter == 0)) && (waterLevel <= 2))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 905]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 720]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) Ensures: (((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) && ((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 622]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: (((((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) == 0))) && ((\old(methaneLevelCritical) != 0) || (methaneLevelCritical != 0))) && (((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 696]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((((waterLevel <= 1) && (waterLevel <= \old(waterLevel))) && (pumpRunning == 1)) || (\old(pumpRunning) != 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (waterLevel <= \old(waterLevel)))) && ((((((pumpRunning == 0) && (waterLevel <= 1)) && (\old(waterLevel) == waterLevel)) || (\old(pumpRunning) != 0)) || (methaneLevelCritical != 0)) || ((\old(waterLevel) == waterLevel) && (pumpRunning == 1)))) && ((((1 == systemActive) && (\old(pumpRunning) == 1)) && (\old(waterLevel) <= 2)) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 2)))) && ((((1 < \old(waterLevel)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (\old(waterLevel) == waterLevel))) || (\old(pumpRunning) != 0)) || (methaneLevelCritical != 0))) && (((\old(pumpRunning) != 0) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel))) || (methaneLevelCritical == 0))) && ((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 494]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 634]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) Ensures: ((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) && (\result == methaneLevelCritical)) && ((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 610]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((methaneLevelCritical == 0) || (pumpRunning != 1)) || (waterLevel < 2)) && (((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || ((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical != 0)) && (waterLevel <= 2)))) Ensures: ((((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (\old(waterLevel) <= 2)) && (pumpRunning == 1)) || (((1 == systemActive) && (\old(waterLevel) <= 1)) && (pumpRunning == 1))) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1))) || ((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical != 0)) && (\old(waterLevel) <= 2))) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && (waterLevel <= 2)) && (((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 728]: Procedure Contract for processEnvironment__wrappee__methaneQuery Derived contract for procedure processEnvironment__wrappee__methaneQuery. Ensures: ((((((((methaneLevelCritical != 0) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || (pumpRunning == 1)) && ((((waterLevel <= 1) && (1 == systemActive)) && (\old(pumpRunning) == 1)) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (waterLevel <= 2)))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (methaneLevelCritical == 0))) && ((\old(pumpRunning) != 1) || (pumpRunning == 1))) && ((((\old(pumpRunning) != 0) || (1 < waterLevel)) || (methaneLevelCritical != 0)) || ((pumpRunning == 0) && (1 == systemActive)))) && (((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive)))) - ProcedureContractResult [Line: 812]: Procedure Contract for isMethaneAlarm Derived contract for procedure isMethaneAlarm. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) Ensures: ((((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) && (\result == methaneLevelCritical)) && ((((((head == \old(head)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 20:54:29,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE