./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product10.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_spec4_product10.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.graphml --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 38e7b274bf01bc93682679c1667a8f3cd31c3ce4f0d8668fbdf6f2f9baca870a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:10:03,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:10:03,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:10:04,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:10:04,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:10:04,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:10:04,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:10:04,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:10:04,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:10:04,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:10:04,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:10:04,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:10:04,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:10:04,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:10:04,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:10:04,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:10:04,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:10:04,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:10:04,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:10:04,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:10:04,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:10:04,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:10:04,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:10:04,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:10:04,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:10:04,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:10:04,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:10:04,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:10:04,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:10:04,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:10:04,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:10:04,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:10:04,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:10:04,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:10:04,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:10:04,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:10:04,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:10:04,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:10:04,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:10:04,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:10:04,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:10:04,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:10:04,098 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:10:04,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:10:04,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:10:04,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:10:04,100 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:10:04,100 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:10:04,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:10:04,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:10:04,101 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:10:04,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:10:04,102 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:10:04,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:10:04,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:10:04,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:10:04,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:10:04,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:10:04,103 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:10:04,103 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:10:04,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:10:04,103 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:10:04,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:10:04,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:10:04,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:10:04,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:10:04,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:10:04,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:10:04,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:10:04,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:10:04,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:10:04,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:10:04,105 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:10:04,105 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:10:04,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:10:04,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 38e7b274bf01bc93682679c1667a8f3cd31c3ce4f0d8668fbdf6f2f9baca870a [2022-02-20 18:10:04,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:10:04,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:10:04,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:10:04,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:10:04,334 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:10:04,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product10.cil.c [2022-02-20 18:10:04,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50190e72/946586ac9c8e466e85f20dbf9256f1ee/FLAGb294b127f [2022-02-20 18:10:04,786 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:10:04,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product10.cil.c [2022-02-20 18:10:04,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50190e72/946586ac9c8e466e85f20dbf9256f1ee/FLAGb294b127f [2022-02-20 18:10:05,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50190e72/946586ac9c8e466e85f20dbf9256f1ee [2022-02-20 18:10:05,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:10:05,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:10:05,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:10:05,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:10:05,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:10:05,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576707a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05, skipping insertion in model container [2022-02-20 18:10:05,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:10:05,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:10:05,431 WARN L230 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_spec4_product10.cil.c[11718,11731] [2022-02-20 18:10:05,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:10:05,485 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:10:05,526 WARN L230 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_spec4_product10.cil.c[11718,11731] [2022-02-20 18:10:05,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:10:05,550 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:10:05,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05 WrapperNode [2022-02-20 18:10:05,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:10:05,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:10:05,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:10:05,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:10:05,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,599 INFO L137 Inliner]: procedures = 51, calls = 147, calls flagged for inlining = 21, calls inlined = 15, statements flattened = 189 [2022-02-20 18:10:05,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:10:05,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:10:05,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:10:05,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:10:05,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:10:05,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:10:05,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:10:05,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:10:05,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (1/1) ... [2022-02-20 18:10:05,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:10:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:10:05,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:10:05,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:10:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:10:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:10:05,700 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:10:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:10:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:10:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:10:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:10:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:10:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:10:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:10:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:10:05,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:10:05,775 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:10:05,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:10:06,008 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:10:06,013 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:10:06,014 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:10:06,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:10:06 BoogieIcfgContainer [2022-02-20 18:10:06,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:10:06,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:10:06,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:10:06,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:10:06,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:10:05" (1/3) ... [2022-02-20 18:10:06,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504ac2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:10:06, skipping insertion in model container [2022-02-20 18:10:06,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:10:05" (2/3) ... [2022-02-20 18:10:06,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504ac2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:10:06, skipping insertion in model container [2022-02-20 18:10:06,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:10:06" (3/3) ... [2022-02-20 18:10:06,022 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product10.cil.c [2022-02-20 18:10:06,027 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:10:06,027 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:10:06,068 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:10:06,073 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:10:06,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:10:06,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 51 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:10:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 18:10:06,101 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:06,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:10:06,102 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1098295289, now seen corresponding path program 1 times [2022-02-20 18:10:06,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:10:06,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32860642] [2022-02-20 18:10:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:10:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:06,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {62#true} is VALID [2022-02-20 18:10:06,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret29#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {62#true} is VALID [2022-02-20 18:10:06,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {62#true} is VALID [2022-02-20 18:10:06,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {62#true} is VALID [2022-02-20 18:10:06,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#true} main_#t~ret29#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret29#1;havoc main_#t~ret29#1; {62#true} is VALID [2022-02-20 18:10:06,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#true} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {62#true} is VALID [2022-02-20 18:10:06,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {62#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {62#true} is VALID [2022-02-20 18:10:06,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#true} assume false; {63#false} is VALID [2022-02-20 18:10:06,359 INFO L272 TraceCheckUtils]: 8: Hoare triple {63#false} call cleanup(); {63#false} is VALID [2022-02-20 18:10:06,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {63#false} havoc ~i~0;havoc ~__cil_tmp2~0; {63#false} is VALID [2022-02-20 18:10:06,360 INFO L272 TraceCheckUtils]: 10: Hoare triple {63#false} call timeShift(); {63#false} is VALID [2022-02-20 18:10:06,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {63#false} assume !(0 != ~pumpRunning~0); {63#false} is VALID [2022-02-20 18:10:06,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {63#false} assume !(0 != ~systemActive~0); {63#false} is VALID [2022-02-20 18:10:06,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {63#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {63#false} is VALID [2022-02-20 18:10:06,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#false} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret4#1 && __utac_acc__Specification4_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {63#false} is VALID [2022-02-20 18:10:06,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {63#false} assume 0 == __utac_acc__Specification4_spec__1_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {63#false} is VALID [2022-02-20 18:10:06,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {63#false} __utac_acc__Specification4_spec__1_#t~ret5#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret5#1 && __utac_acc__Specification4_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp___0~0#1 := __utac_acc__Specification4_spec__1_#t~ret5#1;havoc __utac_acc__Specification4_spec__1_#t~ret5#1; {63#false} is VALID [2022-02-20 18:10:06,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {63#false} assume 0 != __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline___automaton_fail } true; {63#false} is VALID [2022-02-20 18:10:06,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {63#false} assume !false; {63#false} is VALID [2022-02-20 18:10:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:10:06,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:10:06,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32860642] [2022-02-20 18:10:06,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32860642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:06,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:06,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:10:06,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834879545] [2022-02-20 18:10:06,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:06,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 18:10:06,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:06,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:06,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:10:06,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:10:06,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:10:06,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:10:06,430 INFO L87 Difference]: Start difference. First operand has 59 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 51 states have internal predecessors, (66), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:06,516 INFO L93 Difference]: Finished difference Result 110 states and 151 transitions. [2022-02-20 18:10:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:10:06,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 18:10:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2022-02-20 18:10:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2022-02-20 18:10:06,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 151 transitions. [2022-02-20 18:10:06,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:06,648 INFO L225 Difference]: With dead ends: 110 [2022-02-20 18:10:06,648 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 18:10:06,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:10:06,653 INFO L933 BasicCegarLoop]: 72 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, 72 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 [2022-02-20 18:10:06,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 18:10:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 18:10:06,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:06,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:10:06,676 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:10:06,677 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:10:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:06,680 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-02-20 18:10:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-02-20 18:10:06,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:06,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:06,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-02-20 18:10:06,682 INFO L87 Difference]: Start difference. First operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-02-20 18:10:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:06,685 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-02-20 18:10:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-02-20 18:10:06,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:06,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:06,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:06,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:10:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-02-20 18:10:06,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 19 [2022-02-20 18:10:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:06,691 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-02-20 18:10:06,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-02-20 18:10:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 18:10:06,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:06,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:10:06,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:10:06,693 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1016661043, now seen corresponding path program 1 times [2022-02-20 18:10:06,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:10:06,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763226354] [2022-02-20 18:10:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:10:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:06,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {397#true} is VALID [2022-02-20 18:10:06,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret29#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {397#true} is VALID [2022-02-20 18:10:06,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {397#true} is VALID [2022-02-20 18:10:06,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {397#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {397#true} is VALID [2022-02-20 18:10:06,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {397#true} main_#t~ret29#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret29#1;havoc main_#t~ret29#1; {397#true} is VALID [2022-02-20 18:10:06,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#true} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {397#true} is VALID [2022-02-20 18:10:06,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {399#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:10:06,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {399#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:10:06,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {398#false} is VALID [2022-02-20 18:10:06,749 INFO L272 TraceCheckUtils]: 9: Hoare triple {398#false} call cleanup(); {398#false} is VALID [2022-02-20 18:10:06,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {398#false} havoc ~i~0;havoc ~__cil_tmp2~0; {398#false} is VALID [2022-02-20 18:10:06,750 INFO L272 TraceCheckUtils]: 11: Hoare triple {398#false} call timeShift(); {398#false} is VALID [2022-02-20 18:10:06,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {398#false} assume !(0 != ~pumpRunning~0); {398#false} is VALID [2022-02-20 18:10:06,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#false} assume !(0 != ~systemActive~0); {398#false} is VALID [2022-02-20 18:10:06,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {398#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {398#false} is VALID [2022-02-20 18:10:06,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {398#false} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret4#1 && __utac_acc__Specification4_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {398#false} is VALID [2022-02-20 18:10:06,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {398#false} assume 0 == __utac_acc__Specification4_spec__1_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {398#false} is VALID [2022-02-20 18:10:06,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {398#false} __utac_acc__Specification4_spec__1_#t~ret5#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret5#1 && __utac_acc__Specification4_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp___0~0#1 := __utac_acc__Specification4_spec__1_#t~ret5#1;havoc __utac_acc__Specification4_spec__1_#t~ret5#1; {398#false} is VALID [2022-02-20 18:10:06,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {398#false} assume 0 != __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline___automaton_fail } true; {398#false} is VALID [2022-02-20 18:10:06,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-02-20 18:10:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:10:06,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:10:06,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763226354] [2022-02-20 18:10:06,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763226354] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:06,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:06,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:10:06,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780464981] [2022-02-20 18:10:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 18:10:06,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:06,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:06,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:10:06,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:10:06,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:10:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:10:06,770 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:06,812 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-02-20 18:10:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:10:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 18:10:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 18:10:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 18:10:06,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 18:10:06,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:06,868 INFO L225 Difference]: With dead ends: 65 [2022-02-20 18:10:06,869 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 18:10:06,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:10:06,870 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 83 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 [2022-02-20 18:10:06,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 18:10:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 18:10:06,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:06,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:06,874 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:06,874 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:06,876 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-20 18:10:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-20 18:10:06,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:06,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:06,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 18:10:06,877 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 18:10:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:06,879 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-20 18:10:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-20 18:10:06,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:06,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:06,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:06,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-02-20 18:10:06,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 20 [2022-02-20 18:10:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:06,881 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-02-20 18:10:06,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-20 18:10:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:10:06,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:06,882 INFO L514 BasicCegarLoop]: 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] [2022-02-20 18:10:06,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:10:06,883 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:06,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1310673630, now seen corresponding path program 1 times [2022-02-20 18:10:06,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:10:06,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571278423] [2022-02-20 18:10:06,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:10:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:06,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {635#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {635#true} is VALID [2022-02-20 18:10:06,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret29#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {635#true} is VALID [2022-02-20 18:10:06,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {635#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {635#true} is VALID [2022-02-20 18:10:06,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {635#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {637#(= |ULTIMATE.start_valid_product_#res#1| 1)} is VALID [2022-02-20 18:10:06,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {637#(= |ULTIMATE.start_valid_product_#res#1| 1)} main_#t~ret29#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret29#1;havoc main_#t~ret29#1; {638#(= |ULTIMATE.start_main_~tmp~4#1| 1)} is VALID [2022-02-20 18:10:06,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {638#(= |ULTIMATE.start_main_~tmp~4#1| 1)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {635#true} is VALID [2022-02-20 18:10:06,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {635#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {635#true} is VALID [2022-02-20 18:10:06,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {635#true} assume !false; {635#true} is VALID [2022-02-20 18:10:06,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {635#true} assume test_~splverifierCounter~0#1 < 4; {635#true} is VALID [2022-02-20 18:10:06,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {635#true} assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp~6#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {635#true} is VALID [2022-02-20 18:10:06,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {635#true} assume !(0 != test_~tmp~6#1); {635#true} is VALID [2022-02-20 18:10:06,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {635#true} assume -2147483648 <= test_#t~nondet41#1 && test_#t~nondet41#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {635#true} is VALID [2022-02-20 18:10:06,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {635#true} assume !(0 != test_~tmp___0~1#1); {635#true} is VALID [2022-02-20 18:10:06,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#true} assume -2147483648 <= test_#t~nondet42#1 && test_#t~nondet42#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {635#true} is VALID [2022-02-20 18:10:06,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {635#true} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {639#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:10:06,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {639#(not (= 0 ~systemActive~0))} assume { :end_inline_startSystem } true; {639#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:10:06,946 INFO L272 TraceCheckUtils]: 16: Hoare triple {639#(not (= 0 ~systemActive~0))} call timeShift(); {639#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:10:06,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {639#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {639#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:10:06,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {639#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {636#false} is VALID [2022-02-20 18:10:06,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {636#false} is VALID [2022-02-20 18:10:06,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#false} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret4#1 && __utac_acc__Specification4_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {636#false} is VALID [2022-02-20 18:10:06,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {636#false} assume 0 == __utac_acc__Specification4_spec__1_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {636#false} is VALID [2022-02-20 18:10:06,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {636#false} __utac_acc__Specification4_spec__1_#t~ret5#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret5#1 && __utac_acc__Specification4_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp___0~0#1 := __utac_acc__Specification4_spec__1_#t~ret5#1;havoc __utac_acc__Specification4_spec__1_#t~ret5#1; {636#false} is VALID [2022-02-20 18:10:06,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#false} assume 0 != __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline___automaton_fail } true; {636#false} is VALID [2022-02-20 18:10:06,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {636#false} assume !false; {636#false} is VALID [2022-02-20 18:10:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:10:06,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:10:06,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571278423] [2022-02-20 18:10:06,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571278423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:06,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:06,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:10:06,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273914847] [2022-02-20 18:10:06,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 18:10:06,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:06,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:06,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:06,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:10:06,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:10:06,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:10:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:10:06,968 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,077 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-02-20 18:10:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:10:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 18:10:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-02-20 18:10:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-02-20 18:10:07,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 96 transitions. [2022-02-20 18:10:07,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,147 INFO L225 Difference]: With dead ends: 75 [2022-02-20 18:10:07,147 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 18:10:07,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:10:07,148 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 76 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:10:07,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 100 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 18:10:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 18:10:07,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:07,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:07,153 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:07,153 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,154 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-02-20 18:10:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-02-20 18:10:07,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 18:10:07,155 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 18:10:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,156 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-02-20 18:10:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-02-20 18:10:07,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:07,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:10:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-02-20 18:10:07,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 25 [2022-02-20 18:10:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:07,159 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-02-20 18:10:07,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-02-20 18:10:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:10:07,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:07,160 INFO L514 BasicCegarLoop]: 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] [2022-02-20 18:10:07,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:10:07,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -15235957, now seen corresponding path program 1 times [2022-02-20 18:10:07,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:10:07,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015051965] [2022-02-20 18:10:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:10:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:07,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {892#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {894#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret29#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {894#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {894#(= ~waterLevel~0 1)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {894#(= ~waterLevel~0 1)} main_#t~ret29#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret29#1;havoc main_#t~ret29#1; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {894#(= ~waterLevel~0 1)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {894#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {894#(= ~waterLevel~0 1)} assume !false; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {894#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {894#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp~6#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~6#1); {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {894#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet41#1 && test_#t~nondet41#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {894#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~1#1); {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {894#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet42#1 && test_#t~nondet42#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {894#(= ~waterLevel~0 1)} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {894#(= ~waterLevel~0 1)} assume { :end_inline_startSystem } true; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,223 INFO L272 TraceCheckUtils]: 16: Hoare triple {894#(= ~waterLevel~0 1)} call timeShift(); {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {894#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {894#(= ~waterLevel~0 1)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(= ~waterLevel~0 1)} assume { :end_inline_processEnvironment } true; {894#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:10:07,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {894#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {895#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:10:07,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {895#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret4#1 && __utac_acc__Specification4_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {896#(= (+ (- 1) |timeShift___utac_acc__Specification4_spec__1_~tmp~0#1|) 0)} is VALID [2022-02-20 18:10:07,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {896#(= (+ (- 1) |timeShift___utac_acc__Specification4_spec__1_~tmp~0#1|) 0)} assume 0 == __utac_acc__Specification4_spec__1_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {893#false} is VALID [2022-02-20 18:10:07,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {893#false} __utac_acc__Specification4_spec__1_#t~ret5#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret5#1 && __utac_acc__Specification4_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp___0~0#1 := __utac_acc__Specification4_spec__1_#t~ret5#1;havoc __utac_acc__Specification4_spec__1_#t~ret5#1; {893#false} is VALID [2022-02-20 18:10:07,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {893#false} assume 0 != __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline___automaton_fail } true; {893#false} is VALID [2022-02-20 18:10:07,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {893#false} assume !false; {893#false} is VALID [2022-02-20 18:10:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:10:07,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:10:07,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015051965] [2022-02-20 18:10:07,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015051965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:07,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:07,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:10:07,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683934922] [2022-02-20 18:10:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:07,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 18:10:07,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:07,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:10:07,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:10:07,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:10:07,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:10:07,248 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,363 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2022-02-20 18:10:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:10:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 18:10:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-02-20 18:10:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-02-20 18:10:07,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2022-02-20 18:10:07,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,458 INFO L225 Difference]: With dead ends: 102 [2022-02-20 18:10:07,458 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 18:10:07,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:10:07,459 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 24 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:10:07,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 184 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 18:10:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-02-20 18:10:07,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:07,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 18:10:07,466 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 18:10:07,466 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 18:10:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,468 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 18:10:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:10:07,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Second operand 68 states. [2022-02-20 18:10:07,469 INFO L87 Difference]: Start difference. First operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Second operand 68 states. [2022-02-20 18:10:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,471 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-02-20 18:10:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:10:07,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:07,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 60 states have internal predecessors, (72), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 18:10:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2022-02-20 18:10:07,474 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 26 [2022-02-20 18:10:07,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:07,474 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2022-02-20 18:10:07,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2022-02-20 18:10:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:10:07,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:07,475 INFO L514 BasicCegarLoop]: 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] [2022-02-20 18:10:07,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:10:07,476 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -275724090, now seen corresponding path program 1 times [2022-02-20 18:10:07,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:10:07,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236063583] [2022-02-20 18:10:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:10:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:07,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#(= ~pumpRunning~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret29#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {1280#(= ~pumpRunning~0 0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {1280#(= ~pumpRunning~0 0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {1280#(= ~pumpRunning~0 0)} main_#t~ret29#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret29#1;havoc main_#t~ret29#1; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#(= ~pumpRunning~0 0)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#(= ~pumpRunning~0 0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(= ~pumpRunning~0 0)} assume !false; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {1280#(= ~pumpRunning~0 0)} assume test_~splverifierCounter~0#1 < 4; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp~6#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {1280#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp~6#1); {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet41#1 && test_#t~nondet41#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp___0~1#1); {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet42#1 && test_#t~nondet42#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#(= ~pumpRunning~0 0)} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#(= ~pumpRunning~0 0)} assume { :end_inline_startSystem } true; {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,520 INFO L272 TraceCheckUtils]: 16: Hoare triple {1280#(= ~pumpRunning~0 0)} call timeShift(); {1280#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {1280#(= ~pumpRunning~0 0)} assume 0 != ~pumpRunning~0;assume { :begin_inline_lowerWaterLevel } true; {1279#false} is VALID [2022-02-20 18:10:07,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1279#false} assume ~waterLevel~0 > 0;~waterLevel~0 := ~waterLevel~0 - 1; {1279#false} is VALID [2022-02-20 18:10:07,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1279#false} assume { :end_inline_lowerWaterLevel } true; {1279#false} is VALID [2022-02-20 18:10:07,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {1279#false} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true; {1279#false} is VALID [2022-02-20 18:10:07,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {1279#false} assume { :end_inline_processEnvironment } true; {1279#false} is VALID [2022-02-20 18:10:07,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {1279#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1279#false} is VALID [2022-02-20 18:10:07,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {1279#false} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret4#1 && __utac_acc__Specification4_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {1279#false} is VALID [2022-02-20 18:10:07,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {1279#false} assume 0 == __utac_acc__Specification4_spec__1_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {1279#false} is VALID [2022-02-20 18:10:07,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {1279#false} __utac_acc__Specification4_spec__1_#t~ret5#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret5#1 && __utac_acc__Specification4_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp___0~0#1 := __utac_acc__Specification4_spec__1_#t~ret5#1;havoc __utac_acc__Specification4_spec__1_#t~ret5#1; {1279#false} is VALID [2022-02-20 18:10:07,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {1279#false} assume 0 != __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline___automaton_fail } true; {1279#false} is VALID [2022-02-20 18:10:07,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {1279#false} assume !false; {1279#false} is VALID [2022-02-20 18:10:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:10:07,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:10:07,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236063583] [2022-02-20 18:10:07,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236063583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:07,523 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:07,523 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:10:07,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084254308] [2022-02-20 18:10:07,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 18:10:07,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:07,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:10:07,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:10:07,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:10:07,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:10:07,541 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,567 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2022-02-20 18:10:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:10:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 18:10:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 18:10:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 18:10:07,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-02-20 18:10:07,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,626 INFO L225 Difference]: With dead ends: 100 [2022-02-20 18:10:07,626 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 18:10:07,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:10:07,628 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:10:07,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 18:10:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-20 18:10:07,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:07,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:10:07,633 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:10:07,633 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:10:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,634 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 18:10:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 18:10:07,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 65 states. [2022-02-20 18:10:07,635 INFO L87 Difference]: Start difference. First operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 65 states. [2022-02-20 18:10:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,637 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 18:10:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 18:10:07,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:07,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 57 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:10:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-02-20 18:10:07,639 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 28 [2022-02-20 18:10:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:07,640 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-02-20 18:10:07,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:10:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 18:10:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:10:07,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:07,641 INFO L514 BasicCegarLoop]: 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] [2022-02-20 18:10:07,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:10:07,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1658846223, now seen corresponding path program 1 times [2022-02-20 18:10:07,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:10:07,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710511625] [2022-02-20 18:10:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:10:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 18:10:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:07,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {1653#(= |old(~waterLevel~0)| ~waterLevel~0)} assume ~waterLevel~0 < 2;~waterLevel~0 := 1 + ~waterLevel~0; {1645#true} is VALID [2022-02-20 18:10:07,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2022-02-20 18:10:07,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1647#(= ~pumpRunning~0 0)} #168#return; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {1645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret29#1, main_~retValue_acc~3#1, main_~tmp~4#1;havoc main_~retValue_acc~3#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~9#1;havoc valid_product_~retValue_acc~9#1;valid_product_~retValue_acc~9#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~9#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {1647#(= ~pumpRunning~0 0)} main_#t~ret29#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret29#1 && main_#t~ret29#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret29#1;havoc main_#t~ret29#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {1647#(= ~pumpRunning~0 0)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet40#1, test_#t~nondet41#1, test_#t~nondet42#1, test_#t~nondet43#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {1647#(= ~pumpRunning~0 0)} assume !false; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {1647#(= ~pumpRunning~0 0)} assume test_~splverifierCounter~0#1 < 4; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1647#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet40#1 && test_#t~nondet40#1 <= 2147483647;test_~tmp~6#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {1647#(= ~pumpRunning~0 0)} assume 0 != test_~tmp~6#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,701 INFO L272 TraceCheckUtils]: 11: Hoare triple {1647#(= ~pumpRunning~0 0)} call waterRise(); {1653#(= |old(~waterLevel~0)| ~waterLevel~0)} is VALID [2022-02-20 18:10:07,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {1653#(= |old(~waterLevel~0)| ~waterLevel~0)} assume ~waterLevel~0 < 2;~waterLevel~0 := 1 + ~waterLevel~0; {1645#true} is VALID [2022-02-20 18:10:07,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#true} assume true; {1645#true} is VALID [2022-02-20 18:10:07,702 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1645#true} {1647#(= ~pumpRunning~0 0)} #168#return; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {1647#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet41#1 && test_#t~nondet41#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet41#1;havoc test_#t~nondet41#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {1647#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp___0~1#1); {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {1647#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet42#1 && test_#t~nondet42#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet42#1;havoc test_#t~nondet42#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {1647#(= ~pumpRunning~0 0)} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :end_inline_startSystem } true; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,704 INFO L272 TraceCheckUtils]: 20: Hoare triple {1647#(= ~pumpRunning~0 0)} call timeShift(); {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {1647#(= ~pumpRunning~0 0)} assume !(0 != ~pumpRunning~0); {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {1647#(= ~pumpRunning~0 0)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :end_inline_processEnvironment } true; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {1647#(= ~pumpRunning~0 0)} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {1647#(= ~pumpRunning~0 0)} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret4#1 && __utac_acc__Specification4_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {1647#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:10:07,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {1647#(= ~pumpRunning~0 0)} assume 0 == __utac_acc__Specification4_spec__1_~tmp~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~5#1;havoc isPumpRunning_~retValue_acc~5#1;isPumpRunning_~retValue_acc~5#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~5#1; {1651#(= |timeShift_isPumpRunning_#res#1| 0)} is VALID [2022-02-20 18:10:07,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {1651#(= |timeShift_isPumpRunning_#res#1| 0)} __utac_acc__Specification4_spec__1_#t~ret5#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification4_spec__1_#t~ret5#1 && __utac_acc__Specification4_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification4_spec__1_~tmp___0~0#1 := __utac_acc__Specification4_spec__1_#t~ret5#1;havoc __utac_acc__Specification4_spec__1_#t~ret5#1; {1652#(= |timeShift___utac_acc__Specification4_spec__1_~tmp___0~0#1| 0)} is VALID [2022-02-20 18:10:07,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {1652#(= |timeShift___utac_acc__Specification4_spec__1_~tmp___0~0#1| 0)} assume 0 != __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline___automaton_fail } true; {1646#false} is VALID [2022-02-20 18:10:07,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2022-02-20 18:10:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:10:07,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:10:07,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710511625] [2022-02-20 18:10:07,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710511625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:07,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:07,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:10:07,708 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666289451] [2022-02-20 18:10:07,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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 30 [2022-02-20 18:10:07,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:07,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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) [2022-02-20 18:10:07,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:10:07,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:10:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:10:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:10:07,728 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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) [2022-02-20 18:10:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,858 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-02-20 18:10:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:10:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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 30 [2022-02-20 18:10:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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) [2022-02-20 18:10:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 18:10:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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) [2022-02-20 18:10:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 18:10:07,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 18:10:07,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:07,899 INFO L225 Difference]: With dead ends: 70 [2022-02-20 18:10:07,899 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:10:07,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:10:07,900 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:10:07,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:10:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:10:07,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:07,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 18:10:07,901 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 18:10:07,901 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 18:10:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,902 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:10:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:10:07,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,902 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 18:10:07,902 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 18:10:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:07,903 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:10:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:10:07,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:07,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:07,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:07,903 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) [2022-02-20 18:10:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:10:07,903 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-02-20 18:10:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:07,904 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:10:07,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 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) [2022-02-20 18:10:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:10:07,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:07,906 INFO L764 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:10:07,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:10:07,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:10:08,191 INFO L861 garLoopResultBuilder]: At program point changeMethaneLevelENTRY(lines 790 801) the Hoare annotation is: true [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point L794-1(lines 790 801) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point changeMethaneLevelEXIT(lines 790 801) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 578 584) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L854 garLoopResultBuilder]: At program point L770-2(lines 766 777) the Hoare annotation is: (or (not (= ~pumpRunning~0 0)) (= 0 ~systemActive~0)) [2022-02-20 18:10:08,192 INFO L854 garLoopResultBuilder]: At program point L595(lines 591 597) the Hoare annotation is: (or (not (= ~pumpRunning~0 0)) (= |old(~waterLevel~0)| ~waterLevel~0) (= 0 ~systemActive~0)) [2022-02-20 18:10:08,192 INFO L854 garLoopResultBuilder]: At program point L839(lines 834 842) the Hoare annotation is: (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse1 (= 0 ~systemActive~0))) (and (or .cse0 (not (= |old(~waterLevel~0)| 1)) .cse1 (= |timeShift_getWaterLevel_#res#1| 1)) (or .cse0 (= |old(~waterLevel~0)| ~waterLevel~0) .cse1))) [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point timeShiftFINAL(lines 567 590) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 71) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point L449(line 449) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 74) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L854 garLoopResultBuilder]: At program point L61-1(lines 53 77) the Hoare annotation is: (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse1 (= 0 ~systemActive~0))) (and (or .cse0 (not (= |old(~waterLevel~0)| 1)) (and (= |timeShift___utac_acc__Specification4_spec__1_~tmp~0#1| 1) (= |timeShift_getWaterLevel_#res#1| 1)) .cse1) (or .cse0 (= |old(~waterLevel~0)| ~waterLevel~0) .cse1))) [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point L571-1(lines 570 589) no Hoare annotation was computed. [2022-02-20 18:10:08,192 INFO L854 garLoopResultBuilder]: At program point timeShiftENTRY(lines 567 590) the Hoare annotation is: (or (not (= ~pumpRunning~0 0)) (= |old(~waterLevel~0)| ~waterLevel~0) (= 0 ~systemActive~0)) [2022-02-20 18:10:08,192 INFO L858 garLoopResultBuilder]: For program point timeShiftEXIT(lines 567 590) no Hoare annotation was computed. [2022-02-20 18:10:08,193 INFO L858 garLoopResultBuilder]: For program point timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2022-02-20 18:10:08,193 INFO L854 garLoopResultBuilder]: At program point L648(lines 643 651) the Hoare annotation is: (let ((.cse0 (not (= ~pumpRunning~0 0))) (.cse1 (= 0 ~systemActive~0))) (and (or (and (= |timeShift_isPumpRunning_#res#1| 0) (= |old(~waterLevel~0)| ~waterLevel~0)) .cse0 .cse1) (or .cse0 (not (= |old(~waterLevel~0)| 1)) .cse1))) [2022-02-20 18:10:08,193 INFO L858 garLoopResultBuilder]: For program point L770(lines 770 774) no Hoare annotation was computed. [2022-02-20 18:10:08,193 INFO L854 garLoopResultBuilder]: At program point L450(lines 445 452) the Hoare annotation is: (or (not (= ~pumpRunning~0 0)) (= 0 ~systemActive~0)) [2022-02-20 18:10:08,193 INFO L861 garLoopResultBuilder]: At program point L481(lines 456 485) the Hoare annotation is: true [2022-02-20 18:10:08,193 INFO L858 garLoopResultBuilder]: For program point cleanupEXIT(lines 456 485) no Hoare annotation was computed. [2022-02-20 18:10:08,193 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-02-20 18:10:08,193 INFO L861 garLoopResultBuilder]: At program point cleanupENTRY(lines 456 485) the Hoare annotation is: true [2022-02-20 18:10:08,193 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L861 garLoopResultBuilder]: At program point L470-1(lines 470 474) the Hoare annotation is: true [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L467(line 467) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L861 garLoopResultBuilder]: At program point L466-2(lines 466 480) the Hoare annotation is: true [2022-02-20 18:10:08,194 INFO L861 garLoopResultBuilder]: At program point L462(line 462) the Hoare annotation is: true [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L462-1(line 462) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L737(lines 737 750) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L854 garLoopResultBuilder]: At program point L729(line 729) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~4#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,194 INFO L861 garLoopResultBuilder]: At program point L758(lines 697 762) the Hoare annotation is: true [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L717(lines 717 723) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L717-1(lines 717 723) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L854 garLoopResultBuilder]: At program point L874(lines 869 877) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= ~waterLevel~0 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L709(lines 709 713) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L854 garLoopResultBuilder]: At program point L866(lines 862 868) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= ~waterLevel~0 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 551) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point L544-2(lines 544 551) no Hoare annotation was computed. [2022-02-20 18:10:08,194 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:10:08,195 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:10:08,195 INFO L854 garLoopResultBuilder]: At program point L693(lines 688 695) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~4#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,195 INFO L854 garLoopResultBuilder]: At program point L755(lines 706 756) the Hoare annotation is: false [2022-02-20 18:10:08,195 INFO L861 garLoopResultBuilder]: At program point L528(lines 521 530) the Hoare annotation is: true [2022-02-20 18:10:08,195 INFO L861 garLoopResultBuilder]: At program point L553(lines 534 556) the Hoare annotation is: true [2022-02-20 18:10:08,195 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:10:08,195 INFO L854 garLoopResultBuilder]: At program point L859(lines 855 861) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= ~waterLevel~0 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,195 INFO L858 garLoopResultBuilder]: For program point L727(lines 727 733) no Hoare annotation was computed. [2022-02-20 18:10:08,195 INFO L858 garLoopResultBuilder]: For program point L727-1(lines 727 733) no Hoare annotation was computed. [2022-02-20 18:10:08,195 INFO L854 garLoopResultBuilder]: At program point L752(lines 707 754) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~4#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,196 INFO L854 garLoopResultBuilder]: At program point L719(line 719) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~4#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,196 INFO L854 garLoopResultBuilder]: At program point L517(lines 513 519) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~4#1| 1) (= ~waterLevel~0 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,196 INFO L858 garLoopResultBuilder]: For program point L745(lines 745 749) no Hoare annotation was computed. [2022-02-20 18:10:08,196 INFO L854 garLoopResultBuilder]: At program point L745-2(lines 737 750) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~4#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:10:08,196 INFO L858 garLoopResultBuilder]: For program point L708(lines 707 754) no Hoare annotation was computed. [2022-02-20 18:10:08,196 INFO L858 garLoopResultBuilder]: For program point waterRiseEXIT(lines 778 789) no Hoare annotation was computed. [2022-02-20 18:10:08,196 INFO L858 garLoopResultBuilder]: For program point L782-1(lines 778 789) no Hoare annotation was computed. [2022-02-20 18:10:08,196 INFO L854 garLoopResultBuilder]: At program point waterRiseENTRY(lines 778 789) the Hoare annotation is: (or (not (= ~pumpRunning~0 0)) (= |old(~waterLevel~0)| ~waterLevel~0) (= 0 ~systemActive~0)) [2022-02-20 18:10:08,199 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:10:08,200 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:10:08,202 WARN L170 areAnnotationChecker]: L794-1 has no Hoare annotation [2022-02-20 18:10:08,202 WARN L170 areAnnotationChecker]: L794-1 has no Hoare annotation [2022-02-20 18:10:08,202 WARN L170 areAnnotationChecker]: L770 has no Hoare annotation [2022-02-20 18:10:08,202 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 18:10:08,202 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:10:08,202 WARN L170 areAnnotationChecker]: L782-1 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L782-1 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L794-1 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L770 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L770 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 18:10:08,203 WARN L170 areAnnotationChecker]: L462-1 has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: L782-1 has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: changeMethaneLevelEXIT has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2022-02-20 18:10:08,204 WARN L170 areAnnotationChecker]: L462-1 has no Hoare annotation [2022-02-20 18:10:08,205 WARN L170 areAnnotationChecker]: waterRiseEXIT has no Hoare annotation [2022-02-20 18:10:08,205 WARN L170 areAnnotationChecker]: L727-1 has no Hoare annotation [2022-02-20 18:10:08,205 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 18:10:08,205 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L717-1 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L737 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L737 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: cleanupEXIT has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-02-20 18:10:08,206 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: L727 has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: L727 has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: L745 has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: L745 has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: timeShiftFINAL has no Hoare annotation [2022-02-20 18:10:08,207 WARN L170 areAnnotationChecker]: cleanupEXIT has no Hoare annotation [2022-02-20 18:10:08,208 WARN L170 areAnnotationChecker]: L470 has no Hoare annotation [2022-02-20 18:10:08,208 WARN L170 areAnnotationChecker]: L470 has no Hoare annotation [2022-02-20 18:10:08,208 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 18:10:08,208 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2022-02-20 18:10:08,208 WARN L170 areAnnotationChecker]: L727-1 has no Hoare annotation [2022-02-20 18:10:08,209 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 18:10:08,209 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 18:10:08,209 WARN L170 areAnnotationChecker]: timeShiftFINAL has no Hoare annotation [2022-02-20 18:10:08,209 WARN L170 areAnnotationChecker]: L477 has no Hoare annotation [2022-02-20 18:10:08,210 WARN L170 areAnnotationChecker]: L544-2 has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: L708 has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: L449 has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: L449 has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: timeShiftEXIT has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: timeShiftEXIT has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: timeShiftEXIT has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: L544-2 has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: L477 has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:10:08,211 WARN L170 areAnnotationChecker]: L708 has no Hoare annotation [2022-02-20 18:10:08,212 WARN L170 areAnnotationChecker]: L708 has no Hoare annotation [2022-02-20 18:10:08,212 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:10:08,212 WARN L170 areAnnotationChecker]: L709 has no Hoare annotation [2022-02-20 18:10:08,212 WARN L170 areAnnotationChecker]: L717 has no Hoare annotation [2022-02-20 18:10:08,212 WARN L170 areAnnotationChecker]: L717 has no Hoare annotation [2022-02-20 18:10:08,212 WARN L170 areAnnotationChecker]: L717-1 has no Hoare annotation [2022-02-20 18:10:08,213 INFO L163 areAnnotationChecker]: CFG has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:10:08,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:10:08 BoogieIcfgContainer [2022-02-20 18:10:08,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:10:08,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:10:08,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:10:08,224 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:10:08,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:10:06" (3/4) ... [2022-02-20 18:10:08,227 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:10:08,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2022-02-20 18:10:08,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2022-02-20 18:10:08,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2022-02-20 18:10:08,230 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2022-02-20 18:10:08,234 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2022-02-20 18:10:08,234 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-02-20 18:10:08,234 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:10:08,235 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:10:08,235 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:10:08,235 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:10:08,235 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:10:08,250 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((pumpRunning == 0 && \result == 1) && waterLevel == 1) && !(0 == systemActive) [2022-02-20 18:10:08,250 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((pumpRunning == 0 && \result == 1) && tmp == 1) && waterLevel == 1) && !(0 == systemActive) [2022-02-20 18:10:08,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((pumpRunning == 0 && \result == 1) && tmp == 1) && splverifierCounter == 0) && !(0 == systemActive) [2022-02-20 18:10:08,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(pumpRunning == 0) || \old(waterLevel) == waterLevel) || 0 == systemActive [2022-02-20 18:10:08,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((pumpRunning == 0 && \result == 1) && tmp == 1) && splverifierCounter == 0) && !(0 == systemActive) [2022-02-20 18:10:08,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(pumpRunning == 0) || !(\old(waterLevel) == 1)) || 0 == systemActive) || \result == 1) && ((!(pumpRunning == 0) || \old(waterLevel) == waterLevel) || 0 == systemActive) [2022-02-20 18:10:08,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(pumpRunning == 0) || !(\old(waterLevel) == 1)) || (tmp == 1 && \result == 1)) || 0 == systemActive) && ((!(pumpRunning == 0) || \old(waterLevel) == waterLevel) || 0 == systemActive) [2022-02-20 18:10:08,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && \old(waterLevel) == waterLevel) || !(pumpRunning == 0)) || 0 == systemActive) && ((!(pumpRunning == 0) || !(\old(waterLevel) == 1)) || 0 == systemActive) [2022-02-20 18:10:08,261 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:10:08,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:10:08,262 INFO L158 Benchmark]: Toolchain (without parser) took 3108.27ms. Allocated memory was 115.3MB in the beginning and 142.6MB in the end (delta: 27.3MB). Free memory was 73.1MB in the beginning and 58.1MB in the end (delta: 15.0MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2022-02-20 18:10:08,262 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:10:08,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.58ms. Allocated memory is still 115.3MB. Free memory was 72.9MB in the beginning and 77.8MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 18:10:08,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.08ms. Allocated memory is still 115.3MB. Free memory was 77.8MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:10:08,263 INFO L158 Benchmark]: Boogie Preprocessor took 16.09ms. Allocated memory is still 115.3MB. Free memory was 75.2MB in the beginning and 74.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:10:08,263 INFO L158 Benchmark]: RCFGBuilder took 398.18ms. Allocated memory is still 115.3MB. Free memory was 74.0MB in the beginning and 57.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 18:10:08,264 INFO L158 Benchmark]: TraceAbstraction took 2207.17ms. Allocated memory was 115.3MB in the beginning and 142.6MB in the end (delta: 27.3MB). Free memory was 56.3MB in the beginning and 62.3MB in the end (delta: -6.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-02-20 18:10:08,264 INFO L158 Benchmark]: Witness Printer took 37.59ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 58.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:10:08,265 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.58ms. Allocated memory is still 115.3MB. Free memory was 72.9MB in the beginning and 77.8MB in the end (delta: -4.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.08ms. Allocated memory is still 115.3MB. Free memory was 77.8MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.09ms. Allocated memory is still 115.3MB. Free memory was 75.2MB in the beginning and 74.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 398.18ms. Allocated memory is still 115.3MB. Free memory was 74.0MB in the beginning and 57.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2207.17ms. Allocated memory was 115.3MB in the beginning and 142.6MB in the end (delta: 27.3MB). Free memory was 56.3MB in the beginning and 62.3MB in the end (delta: -6.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Witness Printer took 37.59ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 58.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 449]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 619 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 319 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 300 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 105 PreInvPairs, 127 NumberOfFragments, 283 HoareAnnotationTreeSize, 105 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 344 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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: 766]: Loop Invariant Derived loop invariant: !(pumpRunning == 0) || 0 == systemActive - InvariantResult [Line: 707]: Loop Invariant Derived loop invariant: (((pumpRunning == 0 && \result == 1) && tmp == 1) && splverifierCounter == 0) && !(0 == systemActive) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: (((pumpRunning == 0 && \result == 1) && tmp == 1) && splverifierCounter == 0) && !(0 == systemActive) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: !(pumpRunning == 0) || 0 == systemActive - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((!(pumpRunning == 0) || !(\old(waterLevel) == 1)) || (tmp == 1 && \result == 1)) || 0 == systemActive) && ((!(pumpRunning == 0) || \old(waterLevel) == waterLevel) || 0 == systemActive) - InvariantResult [Line: 591]: Loop Invariant Derived loop invariant: (!(pumpRunning == 0) || \old(waterLevel) == waterLevel) || 0 == systemActive - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: (((\result == 0 && \old(waterLevel) == waterLevel) || !(pumpRunning == 0)) || 0 == systemActive) && ((!(pumpRunning == 0) || !(\old(waterLevel) == 1)) || 0 == systemActive) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 521]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 862]: Loop Invariant Derived loop invariant: (pumpRunning == 0 && waterLevel == 1) && !(0 == systemActive) - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: (((!(pumpRunning == 0) || !(\old(waterLevel) == 1)) || 0 == systemActive) || \result == 1) && ((!(pumpRunning == 0) || \old(waterLevel) == waterLevel) || 0 == systemActive) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((pumpRunning == 0 && \result == 1) && waterLevel == 1) && !(0 == systemActive) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: (pumpRunning == 0 && waterLevel == 1) && !(0 == systemActive) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: (((pumpRunning == 0 && \result == 1) && tmp == 1) && waterLevel == 1) && !(0 == systemActive) RESULT: Ultimate proved your program to be correct! [2022-02-20 18:10:08,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE