./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product06.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_spec5_product06.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 c2c09c553453ff5cc1c780de43f9253f29851703b462741b40e69cde342fa216 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:11:33,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:11:33,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:11:33,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:11:33,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:11:33,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:11:33,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:11:33,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:11:33,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:11:33,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:11:33,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:11:33,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:11:33,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:11:33,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:11:33,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:11:33,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:11:33,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:11:33,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:11:33,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:11:33,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:11:33,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:11:33,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:11:33,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:11:33,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:11:33,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:11:33,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:11:33,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:11:33,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:11:33,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:11:33,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:11:33,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:11:33,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:11:33,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:11:33,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:11:33,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:11:33,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:11:33,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:11:33,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:11:33,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:11:33,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:11:33,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:11:33,480 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:11:33,501 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:11:33,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:11:33,507 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:11:33,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:11:33,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:11:33,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:11:33,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:11:33,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:11:33,509 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:11:33,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:11:33,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:11:33,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:11:33,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:11:33,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:11:33,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:11:33,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:11:33,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:11:33,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:11:33,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:11:33,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:11:33,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:11:33,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:11:33,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:11:33,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:11:33,513 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:11:33,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:11:33,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:11:33,513 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 -> c2c09c553453ff5cc1c780de43f9253f29851703b462741b40e69cde342fa216 [2022-02-20 18:11:33,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:11:33,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:11:33,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:11:33,708 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:11:33,708 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:11:33,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c [2022-02-20 18:11:33,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7d5bf27/eb4ba6b97be042aaa6496928dab9f5cc/FLAG8caba3bbd [2022-02-20 18:11:34,174 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:11:34,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c [2022-02-20 18:11:34,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7d5bf27/eb4ba6b97be042aaa6496928dab9f5cc/FLAG8caba3bbd [2022-02-20 18:11:34,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e7d5bf27/eb4ba6b97be042aaa6496928dab9f5cc [2022-02-20 18:11:34,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:11:34,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:11:34,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:11:34,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:11:34,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:11:34,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eeed513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34, skipping insertion in model container [2022-02-20 18:11:34,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:11:34,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:11:34,636 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_spec5_product06.cil.c[17711,17724] [2022-02-20 18:11:34,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:11:34,655 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:11:34,718 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_spec5_product06.cil.c[17711,17724] [2022-02-20 18:11:34,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:11:34,746 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:11:34,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34 WrapperNode [2022-02-20 18:11:34,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:11:34,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:11:34,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:11:34,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:11:34,758 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:11:34" (1/1) ... [2022-02-20 18:11:34,783 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:11:34" (1/1) ... [2022-02-20 18:11:34,813 INFO L137 Inliner]: procedures = 53, calls = 152, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 221 [2022-02-20 18:11:34,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:11:34,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:11:34,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:11:34,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:11:34,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:11:34,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:11:34,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:11:34,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:11:34,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (1/1) ... [2022-02-20 18:11:34,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:11:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:11:34,892 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:11:34,911 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:11:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:11:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:11:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:11:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:11:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:11:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:11:34,935 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:11:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:11:34,935 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:11:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2022-02-20 18:11:34,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2022-02-20 18:11:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:11:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:11:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:11:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:11:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:11:34,992 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:11:34,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:11:35,254 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:11:35,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:11:35,260 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:11:35,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:11:35 BoogieIcfgContainer [2022-02-20 18:11:35,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:11:35,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:11:35,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:11:35,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:11:35,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:11:34" (1/3) ... [2022-02-20 18:11:35,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aba088d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:11:35, skipping insertion in model container [2022-02-20 18:11:35,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:11:34" (2/3) ... [2022-02-20 18:11:35,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aba088d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:11:35, skipping insertion in model container [2022-02-20 18:11:35,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:11:35" (3/3) ... [2022-02-20 18:11:35,292 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product06.cil.c [2022-02-20 18:11:35,296 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:11:35,296 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:11:35,332 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:11:35,337 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:11:35,338 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:11:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 66 states have internal predecessors, (82), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:11:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 18:11:35,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:11:35,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:11:35,364 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:11:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:11:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 382973099, now seen corresponding path program 1 times [2022-02-20 18:11:35,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:11:35,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698051493] [2022-02-20 18:11:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:11:35,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:11:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:35,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 18:11:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:35,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {81#true} is VALID [2022-02-20 18:11:35,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2022-02-20 18:11:35,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81#true} {82#false} #204#return; {82#false} is VALID [2022-02-20 18:11:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 18:11:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:35,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {81#true} is VALID [2022-02-20 18:11:35,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2022-02-20 18:11:35,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81#true} {82#false} #210#return; {82#false} is VALID [2022-02-20 18:11:35,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#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(13, 4);call #Ultimate.allocInit(7, 5);call write~init~int(44, 5, 0, 1);call write~init~int(77, 5, 1, 1);call write~init~int(101, 5, 2, 1);call write~init~int(116, 5, 3, 1);call write~init~int(104, 5, 4, 1);call write~init~int(58, 5, 5, 1);call write~init~int(0, 5, 6, 1);call #Ultimate.allocInit(5, 6);call write~init~int(67, 6, 0, 1);call write~init~int(82, 6, 1, 1);call write~init~int(73, 6, 2, 1);call write~init~int(84, 6, 3, 1);call write~init~int(0, 6, 4, 1);call #Ultimate.allocInit(3, 7);call write~init~int(79, 7, 0, 1);call write~init~int(75, 7, 1, 1);call write~init~int(0, 7, 2, 1);call #Ultimate.allocInit(2, 8);call write~init~int(41, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(13, 9);call #Ultimate.allocInit(3, 10);call write~init~int(79, 10, 0, 1);call write~init~int(110, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(4, 11);call write~init~int(79, 11, 0, 1);call write~init~int(102, 11, 1, 1);call write~init~int(102, 11, 2, 1);call write~init~int(0, 11, 3, 1);call #Ultimate.allocInit(7, 12);call write~init~int(44, 12, 0, 1);call write~init~int(80, 12, 1, 1);call write~init~int(117, 12, 2, 1);call write~init~int(109, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(3, 13);call write~init~int(79, 13, 0, 1);call write~init~int(110, 13, 1, 1);call write~init~int(0, 13, 2, 1);call #Ultimate.allocInit(4, 14);call write~init~int(79, 14, 0, 1);call write~init~int(102, 14, 1, 1);call write~init~int(102, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(3, 15);call write~init~int(41, 15, 0, 1);call write~init~int(32, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(10, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; {81#true} is VALID [2022-02-20 18:11:35,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~6#1, main_~tmp~2#1;havoc main_~retValue_acc~6#1;havoc main_~tmp~2#1;assume { :begin_inline_select_helpers } true; {81#true} is VALID [2022-02-20 18:11:35,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {81#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {81#true} is VALID [2022-02-20 18:11:35,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {81#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~3#1;havoc valid_product_~retValue_acc~3#1;valid_product_~retValue_acc~3#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~3#1; {81#true} is VALID [2022-02-20 18:11:35,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {81#true} main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;main_~tmp~2#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {81#true} is VALID [2022-02-20 18:11:35,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#true} assume 0 != main_~tmp~2#1;assume { :begin_inline_setup } true; {81#true} is VALID [2022-02-20 18:11:35,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0; {81#true} is VALID [2022-02-20 18:11:35,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#true} assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet10#1, test_#t~nondet11#1, test_#t~nondet12#1, test_#t~nondet13#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {81#true} is VALID [2022-02-20 18:11:35,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {81#true} assume !true; {82#false} is VALID [2022-02-20 18:11:35,593 INFO L272 TraceCheckUtils]: 9: Hoare triple {82#false} call cleanup(); {82#false} is VALID [2022-02-20 18:11:35,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {82#false} havoc ~i~0;havoc ~__cil_tmp2~0; {82#false} is VALID [2022-02-20 18:11:35,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {82#false} call timeShift(); {82#false} is VALID [2022-02-20 18:11:35,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {82#false} assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {82#false} is VALID [2022-02-20 18:11:35,594 INFO L272 TraceCheckUtils]: 13: Hoare triple {82#false} call __utac_acc__Specification5_spec__2_#t~ret25#1 := isPumpRunning(); {81#true} is VALID [2022-02-20 18:11:35,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {81#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {81#true} is VALID [2022-02-20 18:11:35,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {81#true} assume true; {81#true} is VALID [2022-02-20 18:11:35,595 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {81#true} {82#false} #204#return; {82#false} is VALID [2022-02-20 18:11:35,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {82#false} assume -2147483648 <= __utac_acc__Specification5_spec__2_#t~ret25#1 && __utac_acc__Specification5_spec__2_#t~ret25#1 <= 2147483647;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret25#1;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {82#false} is VALID [2022-02-20 18:11:35,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {82#false} assume { :end_inline___utac_acc__Specification5_spec__2 } true; {82#false} is VALID [2022-02-20 18:11:35,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {82#false} assume !(0 != ~pumpRunning~0); {82#false} is VALID [2022-02-20 18:11:35,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {82#false} assume !(0 != ~systemActive~0); {82#false} is VALID [2022-02-20 18:11:35,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {82#false} assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret26#1, __utac_acc__Specification5_spec__3_#t~ret27#1, __utac_acc__Specification5_spec__3_~tmp~3#1, __utac_acc__Specification5_spec__3_~tmp___0~1#1;havoc __utac_acc__Specification5_spec__3_~tmp~3#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~1#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; {82#false} is VALID [2022-02-20 18:11:35,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {82#false} __utac_acc__Specification5_spec__3_#t~ret26#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret26#1 && __utac_acc__Specification5_spec__3_#t~ret26#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp~3#1 := __utac_acc__Specification5_spec__3_#t~ret26#1;havoc __utac_acc__Specification5_spec__3_#t~ret26#1; {82#false} is VALID [2022-02-20 18:11:35,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {82#false} assume 2 != __utac_acc__Specification5_spec__3_~tmp~3#1; {82#false} is VALID [2022-02-20 18:11:35,597 INFO L272 TraceCheckUtils]: 24: Hoare triple {82#false} call __utac_acc__Specification5_spec__3_#t~ret27#1 := isPumpRunning(); {81#true} is VALID [2022-02-20 18:11:35,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {81#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {81#true} is VALID [2022-02-20 18:11:35,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {81#true} assume true; {81#true} is VALID [2022-02-20 18:11:35,598 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {81#true} {82#false} #210#return; {82#false} is VALID [2022-02-20 18:11:35,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {82#false} assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret27#1 && __utac_acc__Specification5_spec__3_#t~ret27#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp___0~1#1 := __utac_acc__Specification5_spec__3_#t~ret27#1;havoc __utac_acc__Specification5_spec__3_#t~ret27#1; {82#false} is VALID [2022-02-20 18:11:35,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {82#false} assume 0 != __utac_acc__Specification5_spec__3_~tmp___0~1#1; {82#false} is VALID [2022-02-20 18:11:35,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {82#false} assume 0 == ~switchedOnBeforeTS~0;assume { :begin_inline___automaton_fail } true; {82#false} is VALID [2022-02-20 18:11:35,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {82#false} assume !false; {82#false} is VALID [2022-02-20 18:11:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:11:35,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:11:35,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698051493] [2022-02-20 18:11:35,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698051493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:11:35,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:11:35,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:11:35,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053616117] [2022-02-20 18:11:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:11:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 18:11:35,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:11:35,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:35,650 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:11:35,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:11:35,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:11:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:11:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:11:35,677 INFO L87 Difference]: Start difference. First operand has 78 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 66 states have internal predecessors, (82), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:35,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:35,769 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2022-02-20 18:11:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:11:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 18:11:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:11:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 198 transitions. [2022-02-20 18:11:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 198 transitions. [2022-02-20 18:11:35,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 198 transitions. [2022-02-20 18:11:35,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:35,954 INFO L225 Difference]: With dead ends: 147 [2022-02-20 18:11:35,954 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 18:11:35,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:11:35,960 INFO L933 BasicCegarLoop]: 96 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, 96 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:11:35,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:11:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 18:11:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-02-20 18:11:36,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:11:36,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:11:36,007 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:11:36,008 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:11:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,013 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2022-02-20 18:11:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-02-20 18:11:36,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:36,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:36,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 69 states. [2022-02-20 18:11:36,016 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 69 states. [2022-02-20 18:11:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,021 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2022-02-20 18:11:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-02-20 18:11:36,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:36,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:36,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:11:36,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:11:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:11:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-02-20 18:11:36,028 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 32 [2022-02-20 18:11:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:11:36,028 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-02-20 18:11:36,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-02-20 18:11:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:11:36,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:11:36,031 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:11:36,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:11:36,031 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:11:36,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:11:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash -387004671, now seen corresponding path program 1 times [2022-02-20 18:11:36,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:11:36,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991418622] [2022-02-20 18:11:36,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:11:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:11:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:11:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {545#true} is VALID [2022-02-20 18:11:36,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2022-02-20 18:11:36,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {546#false} #204#return; {546#false} is VALID [2022-02-20 18:11:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 18:11:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {545#true} is VALID [2022-02-20 18:11:36,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2022-02-20 18:11:36,104 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {546#false} #210#return; {546#false} is VALID [2022-02-20 18:11:36,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#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(13, 4);call #Ultimate.allocInit(7, 5);call write~init~int(44, 5, 0, 1);call write~init~int(77, 5, 1, 1);call write~init~int(101, 5, 2, 1);call write~init~int(116, 5, 3, 1);call write~init~int(104, 5, 4, 1);call write~init~int(58, 5, 5, 1);call write~init~int(0, 5, 6, 1);call #Ultimate.allocInit(5, 6);call write~init~int(67, 6, 0, 1);call write~init~int(82, 6, 1, 1);call write~init~int(73, 6, 2, 1);call write~init~int(84, 6, 3, 1);call write~init~int(0, 6, 4, 1);call #Ultimate.allocInit(3, 7);call write~init~int(79, 7, 0, 1);call write~init~int(75, 7, 1, 1);call write~init~int(0, 7, 2, 1);call #Ultimate.allocInit(2, 8);call write~init~int(41, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(13, 9);call #Ultimate.allocInit(3, 10);call write~init~int(79, 10, 0, 1);call write~init~int(110, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(4, 11);call write~init~int(79, 11, 0, 1);call write~init~int(102, 11, 1, 1);call write~init~int(102, 11, 2, 1);call write~init~int(0, 11, 3, 1);call #Ultimate.allocInit(7, 12);call write~init~int(44, 12, 0, 1);call write~init~int(80, 12, 1, 1);call write~init~int(117, 12, 2, 1);call write~init~int(109, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(3, 13);call write~init~int(79, 13, 0, 1);call write~init~int(110, 13, 1, 1);call write~init~int(0, 13, 2, 1);call #Ultimate.allocInit(4, 14);call write~init~int(79, 14, 0, 1);call write~init~int(102, 14, 1, 1);call write~init~int(102, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(3, 15);call write~init~int(41, 15, 0, 1);call write~init~int(32, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(10, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; {545#true} is VALID [2022-02-20 18:11:36,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~6#1, main_~tmp~2#1;havoc main_~retValue_acc~6#1;havoc main_~tmp~2#1;assume { :begin_inline_select_helpers } true; {545#true} is VALID [2022-02-20 18:11:36,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {545#true} is VALID [2022-02-20 18:11:36,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {545#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~3#1;havoc valid_product_~retValue_acc~3#1;valid_product_~retValue_acc~3#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~3#1; {545#true} is VALID [2022-02-20 18:11:36,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {545#true} main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;main_~tmp~2#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {545#true} is VALID [2022-02-20 18:11:36,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} assume 0 != main_~tmp~2#1;assume { :begin_inline_setup } true; {545#true} is VALID [2022-02-20 18:11:36,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0; {545#true} is VALID [2022-02-20 18:11:36,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {545#true} assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet10#1, test_#t~nondet11#1, test_#t~nondet12#1, test_#t~nondet13#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {547#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:11:36,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {547#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:11:36,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {546#false} is VALID [2022-02-20 18:11:36,113 INFO L272 TraceCheckUtils]: 10: Hoare triple {546#false} call cleanup(); {546#false} is VALID [2022-02-20 18:11:36,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#false} havoc ~i~0;havoc ~__cil_tmp2~0; {546#false} is VALID [2022-02-20 18:11:36,114 INFO L272 TraceCheckUtils]: 12: Hoare triple {546#false} call timeShift(); {546#false} is VALID [2022-02-20 18:11:36,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#false} assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {546#false} is VALID [2022-02-20 18:11:36,114 INFO L272 TraceCheckUtils]: 14: Hoare triple {546#false} call __utac_acc__Specification5_spec__2_#t~ret25#1 := isPumpRunning(); {545#true} is VALID [2022-02-20 18:11:36,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {545#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {545#true} is VALID [2022-02-20 18:11:36,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {545#true} assume true; {545#true} is VALID [2022-02-20 18:11:36,115 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {545#true} {546#false} #204#return; {546#false} is VALID [2022-02-20 18:11:36,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {546#false} assume -2147483648 <= __utac_acc__Specification5_spec__2_#t~ret25#1 && __utac_acc__Specification5_spec__2_#t~ret25#1 <= 2147483647;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret25#1;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {546#false} is VALID [2022-02-20 18:11:36,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {546#false} assume { :end_inline___utac_acc__Specification5_spec__2 } true; {546#false} is VALID [2022-02-20 18:11:36,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {546#false} assume !(0 != ~pumpRunning~0); {546#false} is VALID [2022-02-20 18:11:36,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {546#false} assume !(0 != ~systemActive~0); {546#false} is VALID [2022-02-20 18:11:36,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {546#false} assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret26#1, __utac_acc__Specification5_spec__3_#t~ret27#1, __utac_acc__Specification5_spec__3_~tmp~3#1, __utac_acc__Specification5_spec__3_~tmp___0~1#1;havoc __utac_acc__Specification5_spec__3_~tmp~3#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~1#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; {546#false} is VALID [2022-02-20 18:11:36,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {546#false} __utac_acc__Specification5_spec__3_#t~ret26#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret26#1 && __utac_acc__Specification5_spec__3_#t~ret26#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp~3#1 := __utac_acc__Specification5_spec__3_#t~ret26#1;havoc __utac_acc__Specification5_spec__3_#t~ret26#1; {546#false} is VALID [2022-02-20 18:11:36,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {546#false} assume 2 != __utac_acc__Specification5_spec__3_~tmp~3#1; {546#false} is VALID [2022-02-20 18:11:36,116 INFO L272 TraceCheckUtils]: 25: Hoare triple {546#false} call __utac_acc__Specification5_spec__3_#t~ret27#1 := isPumpRunning(); {545#true} is VALID [2022-02-20 18:11:36,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {545#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {545#true} is VALID [2022-02-20 18:11:36,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {545#true} assume true; {545#true} is VALID [2022-02-20 18:11:36,117 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {545#true} {546#false} #210#return; {546#false} is VALID [2022-02-20 18:11:36,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {546#false} assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret27#1 && __utac_acc__Specification5_spec__3_#t~ret27#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp___0~1#1 := __utac_acc__Specification5_spec__3_#t~ret27#1;havoc __utac_acc__Specification5_spec__3_#t~ret27#1; {546#false} is VALID [2022-02-20 18:11:36,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {546#false} assume 0 != __utac_acc__Specification5_spec__3_~tmp___0~1#1; {546#false} is VALID [2022-02-20 18:11:36,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {546#false} assume 0 == ~switchedOnBeforeTS~0;assume { :begin_inline___automaton_fail } true; {546#false} is VALID [2022-02-20 18:11:36,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {546#false} assume !false; {546#false} is VALID [2022-02-20 18:11:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:11:36,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:11:36,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991418622] [2022-02-20 18:11:36,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991418622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:11:36,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:11:36,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:11:36,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718220156] [2022-02-20 18:11:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:11:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-02-20 18:11:36,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:11:36,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:36,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:36,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:11:36,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:11:36,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:11:36,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:11:36,148 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,221 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-02-20 18:11:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:11:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-02-20 18:11:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:11:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-20 18:11:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-20 18:11:36,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2022-02-20 18:11:36,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:36,323 INFO L225 Difference]: With dead ends: 102 [2022-02-20 18:11:36,323 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 18:11:36,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:11:36,325 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 131 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:11:36,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:11:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 18:11:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 18:11:36,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:11:36,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,332 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,333 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,336 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-02-20 18:11:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-20 18:11:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:36,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:36,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 60 states. [2022-02-20 18:11:36,337 INFO L87 Difference]: Start difference. First operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 60 states. [2022-02-20 18:11:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,340 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-02-20 18:11:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-20 18:11:36,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:36,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:36,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:11:36,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:11:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-02-20 18:11:36,344 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2022-02-20 18:11:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:11:36,345 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-02-20 18:11:36,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:11:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-02-20 18:11:36,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:11:36,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:11:36,346 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:11:36,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:11:36,347 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:11:36,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:11:36,348 INFO L85 PathProgramCache]: Analyzing trace with hash 864379304, now seen corresponding path program 1 times [2022-02-20 18:11:36,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:11:36,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291960933] [2022-02-20 18:11:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:11:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:11:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:11:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {912#true} is VALID [2022-02-20 18:11:36,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-02-20 18:11:36,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {916#(not (= 0 ~systemActive~0))} #204#return; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 18:11:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {912#true} is VALID [2022-02-20 18:11:36,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-02-20 18:11:36,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {913#false} #210#return; {913#false} is VALID [2022-02-20 18:11:36,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#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(13, 4);call #Ultimate.allocInit(7, 5);call write~init~int(44, 5, 0, 1);call write~init~int(77, 5, 1, 1);call write~init~int(101, 5, 2, 1);call write~init~int(116, 5, 3, 1);call write~init~int(104, 5, 4, 1);call write~init~int(58, 5, 5, 1);call write~init~int(0, 5, 6, 1);call #Ultimate.allocInit(5, 6);call write~init~int(67, 6, 0, 1);call write~init~int(82, 6, 1, 1);call write~init~int(73, 6, 2, 1);call write~init~int(84, 6, 3, 1);call write~init~int(0, 6, 4, 1);call #Ultimate.allocInit(3, 7);call write~init~int(79, 7, 0, 1);call write~init~int(75, 7, 1, 1);call write~init~int(0, 7, 2, 1);call #Ultimate.allocInit(2, 8);call write~init~int(41, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(13, 9);call #Ultimate.allocInit(3, 10);call write~init~int(79, 10, 0, 1);call write~init~int(110, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(4, 11);call write~init~int(79, 11, 0, 1);call write~init~int(102, 11, 1, 1);call write~init~int(102, 11, 2, 1);call write~init~int(0, 11, 3, 1);call #Ultimate.allocInit(7, 12);call write~init~int(44, 12, 0, 1);call write~init~int(80, 12, 1, 1);call write~init~int(117, 12, 2, 1);call write~init~int(109, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(3, 13);call write~init~int(79, 13, 0, 1);call write~init~int(110, 13, 1, 1);call write~init~int(0, 13, 2, 1);call #Ultimate.allocInit(4, 14);call write~init~int(79, 14, 0, 1);call write~init~int(102, 14, 1, 1);call write~init~int(102, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(3, 15);call write~init~int(41, 15, 0, 1);call write~init~int(32, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(10, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; {912#true} is VALID [2022-02-20 18:11:36,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~6#1, main_~tmp~2#1;havoc main_~retValue_acc~6#1;havoc main_~tmp~2#1;assume { :begin_inline_select_helpers } true; {912#true} is VALID [2022-02-20 18:11:36,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {912#true} is VALID [2022-02-20 18:11:36,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {912#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~3#1;havoc valid_product_~retValue_acc~3#1;valid_product_~retValue_acc~3#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~3#1; {914#(= |ULTIMATE.start_valid_product_#res#1| 1)} is VALID [2022-02-20 18:11:36,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {914#(= |ULTIMATE.start_valid_product_#res#1| 1)} main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;main_~tmp~2#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {915#(= |ULTIMATE.start_main_~tmp~2#1| 1)} is VALID [2022-02-20 18:11:36,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {915#(= |ULTIMATE.start_main_~tmp~2#1| 1)} assume 0 != main_~tmp~2#1;assume { :begin_inline_setup } true; {912#true} is VALID [2022-02-20 18:11:36,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0; {912#true} is VALID [2022-02-20 18:11:36,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet10#1, test_#t~nondet11#1, test_#t~nondet12#1, test_#t~nondet13#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {912#true} is VALID [2022-02-20 18:11:36,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !false; {912#true} is VALID [2022-02-20 18:11:36,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume test_~splverifierCounter~0#1 < 4; {912#true} is VALID [2022-02-20 18:11:36,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {912#true} assume -2147483648 <= test_#t~nondet10#1 && test_#t~nondet10#1 <= 2147483647;test_~tmp~0#1 := test_#t~nondet10#1;havoc test_#t~nondet10#1; {912#true} is VALID [2022-02-20 18:11:36,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} assume !(0 != test_~tmp~0#1); {912#true} is VALID [2022-02-20 18:11:36,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#true} assume -2147483648 <= test_#t~nondet11#1 && test_#t~nondet11#1 <= 2147483647;test_~tmp___0~0#1 := test_#t~nondet11#1;havoc test_#t~nondet11#1; {912#true} is VALID [2022-02-20 18:11:36,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#true} assume !(0 != test_~tmp___0~0#1); {912#true} is VALID [2022-02-20 18:11:36,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {912#true} assume -2147483648 <= test_#t~nondet12#1 && test_#t~nondet12#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet12#1;havoc test_#t~nondet12#1; {912#true} is VALID [2022-02-20 18:11:36,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#(not (= 0 ~systemActive~0))} assume { :end_inline_startSystem } true; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,437 INFO L272 TraceCheckUtils]: 17: Hoare triple {916#(not (= 0 ~systemActive~0))} call timeShift(); {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {916#(not (= 0 ~systemActive~0))} assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,438 INFO L272 TraceCheckUtils]: 19: Hoare triple {916#(not (= 0 ~systemActive~0))} call __utac_acc__Specification5_spec__2_#t~ret25#1 := isPumpRunning(); {912#true} is VALID [2022-02-20 18:11:36,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {912#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {912#true} is VALID [2022-02-20 18:11:36,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {912#true} assume true; {912#true} is VALID [2022-02-20 18:11:36,439 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {912#true} {916#(not (= 0 ~systemActive~0))} #204#return; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {916#(not (= 0 ~systemActive~0))} assume -2147483648 <= __utac_acc__Specification5_spec__2_#t~ret25#1 && __utac_acc__Specification5_spec__2_#t~ret25#1 <= 2147483647;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret25#1;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {916#(not (= 0 ~systemActive~0))} assume { :end_inline___utac_acc__Specification5_spec__2 } true; {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {916#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {916#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:11:36,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {916#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {913#false} is VALID [2022-02-20 18:11:36,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {913#false} assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret26#1, __utac_acc__Specification5_spec__3_#t~ret27#1, __utac_acc__Specification5_spec__3_~tmp~3#1, __utac_acc__Specification5_spec__3_~tmp___0~1#1;havoc __utac_acc__Specification5_spec__3_~tmp~3#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~1#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; {913#false} is VALID [2022-02-20 18:11:36,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {913#false} __utac_acc__Specification5_spec__3_#t~ret26#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret26#1 && __utac_acc__Specification5_spec__3_#t~ret26#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp~3#1 := __utac_acc__Specification5_spec__3_#t~ret26#1;havoc __utac_acc__Specification5_spec__3_#t~ret26#1; {913#false} is VALID [2022-02-20 18:11:36,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {913#false} assume 2 != __utac_acc__Specification5_spec__3_~tmp~3#1; {913#false} is VALID [2022-02-20 18:11:36,441 INFO L272 TraceCheckUtils]: 30: Hoare triple {913#false} call __utac_acc__Specification5_spec__3_#t~ret27#1 := isPumpRunning(); {912#true} is VALID [2022-02-20 18:11:36,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {912#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {912#true} is VALID [2022-02-20 18:11:36,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {912#true} assume true; {912#true} is VALID [2022-02-20 18:11:36,442 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {912#true} {913#false} #210#return; {913#false} is VALID [2022-02-20 18:11:36,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {913#false} assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret27#1 && __utac_acc__Specification5_spec__3_#t~ret27#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp___0~1#1 := __utac_acc__Specification5_spec__3_#t~ret27#1;havoc __utac_acc__Specification5_spec__3_#t~ret27#1; {913#false} is VALID [2022-02-20 18:11:36,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {913#false} assume 0 != __utac_acc__Specification5_spec__3_~tmp___0~1#1; {913#false} is VALID [2022-02-20 18:11:36,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {913#false} assume 0 == ~switchedOnBeforeTS~0;assume { :begin_inline___automaton_fail } true; {913#false} is VALID [2022-02-20 18:11:36,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-02-20 18:11:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:11:36,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:11:36,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291960933] [2022-02-20 18:11:36,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291960933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:11:36,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:11:36,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:11:36,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547955966] [2022-02-20 18:11:36,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:11:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-02-20 18:11:36,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:11:36,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:11:36,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:36,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:11:36,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:11:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:11:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:11:36,493 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:11:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,682 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2022-02-20 18:11:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:11:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-02-20 18:11:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:11:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:11:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2022-02-20 18:11:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:11:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2022-02-20 18:11:36,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 143 transitions. [2022-02-20 18:11:36,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:36,793 INFO L225 Difference]: With dead ends: 112 [2022-02-20 18:11:36,794 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 18:11:36,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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:11:36,795 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 98 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 170 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:11:36,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 170 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:11:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 18:11:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 18:11:36,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:11:36,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,803 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,803 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,805 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-02-20 18:11:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-02-20 18:11:36,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:36,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:36,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 60 states. [2022-02-20 18:11:36,807 INFO L87 Difference]: Start difference. First operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 60 states. [2022-02-20 18:11:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:36,809 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-02-20 18:11:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-02-20 18:11:36,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:36,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:36,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:11:36,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:11:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 52 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 18:11:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-02-20 18:11:36,813 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 38 [2022-02-20 18:11:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:11:36,813 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-02-20 18:11:36,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:11:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-02-20 18:11:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 18:11:36,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:11:36,815 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:11:36,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:11:36,815 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:11:36,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:11:36,816 INFO L85 PathProgramCache]: Analyzing trace with hash -627791397, now seen corresponding path program 1 times [2022-02-20 18:11:36,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:11:36,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362166539] [2022-02-20 18:11:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:11:36,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:11:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:11:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {1298#true} is VALID [2022-02-20 18:11:36,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 18:11:36,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1298#true} {1300#(= ~pumpRunning~0 0)} #204#return; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 18:11:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 18:11:36,897 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {1298#true} {1300#(= ~pumpRunning~0 0)} #208#return; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 18:11:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:11:36,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} is VALID [2022-02-20 18:11:36,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} assume true; {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} is VALID [2022-02-20 18:11:36,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} {1300#(= ~pumpRunning~0 0)} #210#return; {1309#(= 0 |timeShift___utac_acc__Specification5_spec__3_#t~ret27#1|)} is VALID [2022-02-20 18:11:36,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#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(13, 4);call #Ultimate.allocInit(7, 5);call write~init~int(44, 5, 0, 1);call write~init~int(77, 5, 1, 1);call write~init~int(101, 5, 2, 1);call write~init~int(116, 5, 3, 1);call write~init~int(104, 5, 4, 1);call write~init~int(58, 5, 5, 1);call write~init~int(0, 5, 6, 1);call #Ultimate.allocInit(5, 6);call write~init~int(67, 6, 0, 1);call write~init~int(82, 6, 1, 1);call write~init~int(73, 6, 2, 1);call write~init~int(84, 6, 3, 1);call write~init~int(0, 6, 4, 1);call #Ultimate.allocInit(3, 7);call write~init~int(79, 7, 0, 1);call write~init~int(75, 7, 1, 1);call write~init~int(0, 7, 2, 1);call #Ultimate.allocInit(2, 8);call write~init~int(41, 8, 0, 1);call write~init~int(0, 8, 1, 1);call #Ultimate.allocInit(13, 9);call #Ultimate.allocInit(3, 10);call write~init~int(79, 10, 0, 1);call write~init~int(110, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(4, 11);call write~init~int(79, 11, 0, 1);call write~init~int(102, 11, 1, 1);call write~init~int(102, 11, 2, 1);call write~init~int(0, 11, 3, 1);call #Ultimate.allocInit(7, 12);call write~init~int(44, 12, 0, 1);call write~init~int(80, 12, 1, 1);call write~init~int(117, 12, 2, 1);call write~init~int(109, 12, 3, 1);call write~init~int(112, 12, 4, 1);call write~init~int(58, 12, 5, 1);call write~init~int(0, 12, 6, 1);call #Ultimate.allocInit(3, 13);call write~init~int(79, 13, 0, 1);call write~init~int(110, 13, 1, 1);call write~init~int(0, 13, 2, 1);call #Ultimate.allocInit(4, 14);call write~init~int(79, 14, 0, 1);call write~init~int(102, 14, 1, 1);call write~init~int(102, 14, 2, 1);call write~init~int(0, 14, 3, 1);call #Ultimate.allocInit(3, 15);call write~init~int(41, 15, 0, 1);call write~init~int(32, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(10, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret24#1, main_~retValue_acc~6#1, main_~tmp~2#1;havoc main_~retValue_acc~6#1;havoc main_~tmp~2#1;assume { :begin_inline_select_helpers } true; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {1300#(= ~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~3#1;havoc valid_product_~retValue_acc~3#1;valid_product_~retValue_acc~3#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~3#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {1300#(= ~pumpRunning~0 0)} main_#t~ret24#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret24#1 && main_#t~ret24#1 <= 2147483647;main_~tmp~2#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {1300#(= ~pumpRunning~0 0)} assume 0 != main_~tmp~2#1;assume { :begin_inline_setup } true; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline___utac_acc__Specification5_spec__1 } true;~switchedOnBeforeTS~0 := 0; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline___utac_acc__Specification5_spec__1 } true;assume { :begin_inline_test } true;havoc test_#t~nondet10#1, test_#t~nondet11#1, test_#t~nondet12#1, test_#t~nondet13#1, test_~splverifierCounter~0#1, test_~tmp~0#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~0#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {1300#(= ~pumpRunning~0 0)} assume !false; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {1300#(= ~pumpRunning~0 0)} assume test_~splverifierCounter~0#1 < 4; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {1300#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet10#1 && test_#t~nondet10#1 <= 2147483647;test_~tmp~0#1 := test_#t~nondet10#1;havoc test_#t~nondet10#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {1300#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp~0#1); {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1300#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet11#1 && test_#t~nondet11#1 <= 2147483647;test_~tmp___0~0#1 := test_#t~nondet11#1;havoc test_#t~nondet11#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {1300#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp___0~0#1); {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {1300#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet12#1 && test_#t~nondet12#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet12#1;havoc test_#t~nondet12#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {1300#(= ~pumpRunning~0 0)} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline_startSystem } true; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,925 INFO L272 TraceCheckUtils]: 17: Hoare triple {1300#(= ~pumpRunning~0 0)} call timeShift(); {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :begin_inline___utac_acc__Specification5_spec__2 } true;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,926 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(= ~pumpRunning~0 0)} call __utac_acc__Specification5_spec__2_#t~ret25#1 := isPumpRunning(); {1298#true} is VALID [2022-02-20 18:11:36,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {1298#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {1298#true} is VALID [2022-02-20 18:11:36,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 18:11:36,926 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1298#true} {1300#(= ~pumpRunning~0 0)} #204#return; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {1300#(= ~pumpRunning~0 0)} assume -2147483648 <= __utac_acc__Specification5_spec__2_#t~ret25#1 && __utac_acc__Specification5_spec__2_#t~ret25#1 <= 2147483647;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret25#1;havoc __utac_acc__Specification5_spec__2_#t~ret25#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline___utac_acc__Specification5_spec__2 } true; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(= ~pumpRunning~0 0)} assume !(0 != ~pumpRunning~0); {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {1300#(= ~pumpRunning~0 0)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret14#1, processEnvironment_~tmp~1#1;havoc processEnvironment_~tmp~1#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {1300#(= ~pumpRunning~0 0)} assume !(0 != ~pumpRunning~0); {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,929 INFO L272 TraceCheckUtils]: 28: Hoare triple {1300#(= ~pumpRunning~0 0)} call processEnvironment__wrappee__base(); {1298#true} is VALID [2022-02-20 18:11:36,929 INFO L290 TraceCheckUtils]: 29: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 18:11:36,929 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1298#true} {1300#(= ~pumpRunning~0 0)} #208#return; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :end_inline_processEnvironment } true; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {1300#(= ~pumpRunning~0 0)} assume { :begin_inline___utac_acc__Specification5_spec__3 } true;havoc __utac_acc__Specification5_spec__3_#t~ret26#1, __utac_acc__Specification5_spec__3_#t~ret27#1, __utac_acc__Specification5_spec__3_~tmp~3#1, __utac_acc__Specification5_spec__3_~tmp___0~1#1;havoc __utac_acc__Specification5_spec__3_~tmp~3#1;havoc __utac_acc__Specification5_spec__3_~tmp___0~1#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~1#1;havoc getWaterLevel_~retValue_acc~1#1;getWaterLevel_~retValue_acc~1#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~1#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,930 INFO L290 TraceCheckUtils]: 33: Hoare triple {1300#(= ~pumpRunning~0 0)} __utac_acc__Specification5_spec__3_#t~ret26#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret26#1 && __utac_acc__Specification5_spec__3_#t~ret26#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp~3#1 := __utac_acc__Specification5_spec__3_#t~ret26#1;havoc __utac_acc__Specification5_spec__3_#t~ret26#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {1300#(= ~pumpRunning~0 0)} assume 2 != __utac_acc__Specification5_spec__3_~tmp~3#1; {1300#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:11:36,931 INFO L272 TraceCheckUtils]: 35: Hoare triple {1300#(= ~pumpRunning~0 0)} call __utac_acc__Specification5_spec__3_#t~ret27#1 := isPumpRunning(); {1298#true} is VALID [2022-02-20 18:11:36,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {1298#true} havoc ~retValue_acc~5;~retValue_acc~5 := ~pumpRunning~0;#res := ~retValue_acc~5; {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} is VALID [2022-02-20 18:11:36,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} assume true; {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} is VALID [2022-02-20 18:11:36,932 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1311#(= ~pumpRunning~0 |isPumpRunning_#res|)} {1300#(= ~pumpRunning~0 0)} #210#return; {1309#(= 0 |timeShift___utac_acc__Specification5_spec__3_#t~ret27#1|)} is VALID [2022-02-20 18:11:36,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {1309#(= 0 |timeShift___utac_acc__Specification5_spec__3_#t~ret27#1|)} assume -2147483648 <= __utac_acc__Specification5_spec__3_#t~ret27#1 && __utac_acc__Specification5_spec__3_#t~ret27#1 <= 2147483647;__utac_acc__Specification5_spec__3_~tmp___0~1#1 := __utac_acc__Specification5_spec__3_#t~ret27#1;havoc __utac_acc__Specification5_spec__3_#t~ret27#1; {1310#(= |timeShift___utac_acc__Specification5_spec__3_~tmp___0~1#1| 0)} is VALID [2022-02-20 18:11:36,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {1310#(= |timeShift___utac_acc__Specification5_spec__3_~tmp___0~1#1| 0)} assume 0 != __utac_acc__Specification5_spec__3_~tmp___0~1#1; {1299#false} is VALID [2022-02-20 18:11:36,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {1299#false} assume 0 == ~switchedOnBeforeTS~0;assume { :begin_inline___automaton_fail } true; {1299#false} is VALID [2022-02-20 18:11:36,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {1299#false} assume !false; {1299#false} is VALID [2022-02-20 18:11:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:11:36,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:11:36,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362166539] [2022-02-20 18:11:36,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362166539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:11:36,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:11:36,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:11:36,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033615846] [2022-02-20 18:11:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:11:36,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-02-20 18:11:36,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:11:36,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 18:11:36,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:36,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:11:36,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:11:36,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:11:36,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:11:36,967 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 18:11:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:37,152 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-02-20 18:11:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:11:37,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-02-20 18:11:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:11:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 18:11:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-02-20 18:11:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 18:11:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-02-20 18:11:37,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 131 transitions. [2022-02-20 18:11:37,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:11:37,243 INFO L225 Difference]: With dead ends: 105 [2022-02-20 18:11:37,243 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 18:11:37,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 18:11:37,246 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 29 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:11:37,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 204 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:11:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 18:11:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 18:11:37,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:11:37,247 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:11:37,248 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:11:37,248 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:11:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:37,248 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:11:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:11:37,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:37,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:37,249 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:11:37,249 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:11:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:11:37,249 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 18:11:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:11:37,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:37,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:11:37,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:11:37,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:11:37,250 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:11:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 18:11:37,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-02-20 18:11:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:11:37,251 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 18:11:37,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 18:11:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 18:11:37,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:11:37,254 INFO L764 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:11:37,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:11:37,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 18:11:37,611 INFO L858 garLoopResultBuilder]: For program point processEnvironment__wrappee__baseEXIT(lines 280 286) no Hoare annotation was computed. [2022-02-20 18:11:37,612 INFO L861 garLoopResultBuilder]: At program point processEnvironment__wrappee__baseFINAL(lines 280 286) the Hoare annotation is: true [2022-02-20 18:11:37,612 INFO L861 garLoopResultBuilder]: At program point changeMethaneLevelENTRY(lines 82 93) the Hoare annotation is: true [2022-02-20 18:11:37,612 INFO L858 garLoopResultBuilder]: For program point changeMethaneLevelEXIT(lines 82 93) no Hoare annotation was computed. [2022-02-20 18:11:37,612 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 82 93) no Hoare annotation was computed. [2022-02-20 18:11:37,613 INFO L858 garLoopResultBuilder]: For program point L416(line 416) no Hoare annotation was computed. [2022-02-20 18:11:37,613 INFO L858 garLoopResultBuilder]: For program point cleanupEXIT(lines 395 424) no Hoare annotation was computed. [2022-02-20 18:11:37,613 INFO L861 garLoopResultBuilder]: At program point cleanupENTRY(lines 395 424) the Hoare annotation is: true [2022-02-20 18:11:37,613 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2022-02-20 18:11:37,613 INFO L861 garLoopResultBuilder]: At program point L409-1(lines 409 413) the Hoare annotation is: true [2022-02-20 18:11:37,613 INFO L858 garLoopResultBuilder]: For program point L406(line 406) no Hoare annotation was computed. [2022-02-20 18:11:37,614 INFO L861 garLoopResultBuilder]: At program point L405-2(lines 405 419) the Hoare annotation is: true [2022-02-20 18:11:37,614 INFO L861 garLoopResultBuilder]: At program point L401(line 401) the Hoare annotation is: true [2022-02-20 18:11:37,614 INFO L858 garLoopResultBuilder]: For program point L401-1(line 401) no Hoare annotation was computed. [2022-02-20 18:11:37,614 INFO L861 garLoopResultBuilder]: At program point L420(lines 395 424) the Hoare annotation is: true [2022-02-20 18:11:37,614 INFO L858 garLoopResultBuilder]: For program point L267-1(lines 267 273) no Hoare annotation was computed. [2022-02-20 18:11:37,614 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 304) no Hoare annotation was computed. [2022-02-20 18:11:37,615 INFO L858 garLoopResultBuilder]: For program point timeShiftFINAL(lines 253 279) no Hoare annotation was computed. [2022-02-20 18:11:37,615 INFO L858 garLoopResultBuilder]: For program point L292(lines 292 309) no Hoare annotation was computed. [2022-02-20 18:11:37,615 INFO L854 garLoopResultBuilder]: At program point L131(lines 126 134) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,615 INFO L854 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,615 INFO L858 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-02-20 18:11:37,616 INFO L858 garLoopResultBuilder]: For program point L912(line 912) no Hoare annotation was computed. [2022-02-20 18:11:37,616 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 534) no Hoare annotation was computed. [2022-02-20 18:11:37,616 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 537) no Hoare annotation was computed. [2022-02-20 18:11:37,616 INFO L854 garLoopResultBuilder]: At program point L520-1(lines 512 540) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,616 INFO L854 garLoopResultBuilder]: At program point L326(lines 321 328) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,616 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 266) no Hoare annotation was computed. [2022-02-20 18:11:37,617 INFO L854 garLoopResultBuilder]: At program point L99(lines 94 102) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,617 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 256 278) no Hoare annotation was computed. [2022-02-20 18:11:37,617 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2022-02-20 18:11:37,617 INFO L854 garLoopResultBuilder]: At program point L62-2(lines 58 69) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,617 INFO L854 garLoopResultBuilder]: At program point L913(lines 908 915) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,617 INFO L854 garLoopResultBuilder]: At program point L302(line 302) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,618 INFO L858 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2022-02-20 18:11:37,618 INFO L854 garLoopResultBuilder]: At program point L509(lines 502 511) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,618 INFO L854 garLoopResultBuilder]: At program point L307(line 307) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,618 INFO L854 garLoopResultBuilder]: At program point L307-1(lines 288 312) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,620 INFO L854 garLoopResultBuilder]: At program point L336(lines 329 339) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,620 INFO L854 garLoopResultBuilder]: At program point timeShiftENTRY(lines 253 279) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,620 INFO L858 garLoopResultBuilder]: For program point timeShiftEXIT(lines 253 279) no Hoare annotation was computed. [2022-02-20 18:11:37,620 INFO L854 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (or (not (= |old(~pumpRunning~0)| 0)) (= ~pumpRunning~0 0) (= 0 ~systemActive~0)) [2022-02-20 18:11:37,620 INFO L858 garLoopResultBuilder]: For program point L522-1(line 522) no Hoare annotation was computed. [2022-02-20 18:11:37,620 INFO L858 garLoopResultBuilder]: For program point timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION(line 912) no Hoare annotation was computed. [2022-02-20 18:11:37,621 INFO L858 garLoopResultBuilder]: For program point L225(lines 225 229) no Hoare annotation was computed. [2022-02-20 18:11:37,621 INFO L854 garLoopResultBuilder]: At program point L225-2(lines 217 230) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,621 INFO L858 garLoopResultBuilder]: For program point L188(lines 187 234) no Hoare annotation was computed. [2022-02-20 18:11:37,621 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 230) no Hoare annotation was computed. [2022-02-20 18:11:37,621 INFO L854 garLoopResultBuilder]: At program point L209(line 209) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,622 INFO L861 garLoopResultBuilder]: At program point L465(lines 457 467) the Hoare annotation is: true [2022-02-20 18:11:37,622 INFO L861 garLoopResultBuilder]: At program point L238(lines 177 242) the Hoare annotation is: true [2022-02-20 18:11:37,622 INFO L854 garLoopResultBuilder]: At program point L453(lines 449 455) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,622 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 203) no Hoare annotation was computed. [2022-02-20 18:11:37,622 INFO L858 garLoopResultBuilder]: For program point L197-1(lines 197 203) no Hoare annotation was computed. [2022-02-20 18:11:37,622 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 18:11:37,622 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 485) no Hoare annotation was computed. [2022-02-20 18:11:37,623 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 18:11:37,623 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 193) no Hoare annotation was computed. [2022-02-20 18:11:37,623 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 18:11:37,623 INFO L858 garLoopResultBuilder]: For program point L478-2(lines 478 485) no Hoare annotation was computed. [2022-02-20 18:11:37,623 INFO L854 garLoopResultBuilder]: At program point L499(lines 494 501) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,623 INFO L854 garLoopResultBuilder]: At program point L235(lines 186 236) the Hoare annotation is: false [2022-02-20 18:11:37,624 INFO L854 garLoopResultBuilder]: At program point L169(lines 164 172) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,624 INFO L861 garLoopResultBuilder]: At program point L487(lines 468 490) the Hoare annotation is: true [2022-02-20 18:11:37,624 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 163) the Hoare annotation is: (and (= ~pumpRunning~0 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,624 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 18:11:37,624 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-02-20 18:11:37,624 INFO L858 garLoopResultBuilder]: For program point L207-1(lines 207 213) no Hoare annotation was computed. [2022-02-20 18:11:37,625 INFO L854 garLoopResultBuilder]: At program point L232(lines 187 234) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,625 INFO L854 garLoopResultBuilder]: At program point L199(line 199) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,625 INFO L854 garLoopResultBuilder]: At program point L154(lines 150 156) the Hoare annotation is: (and (= ~pumpRunning~0 0) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,625 INFO L854 garLoopResultBuilder]: At program point L390(lines 385 392) the Hoare annotation is: (and (= ~pumpRunning~0 0) (= |ULTIMATE.start_valid_product_#res#1| 1) (= |ULTIMATE.start_test_~splverifierCounter~0#1| 0) (= |ULTIMATE.start_main_~tmp~2#1| 1) (not (= 0 ~systemActive~0))) [2022-02-20 18:11:37,625 INFO L858 garLoopResultBuilder]: For program point waterRiseEXIT(lines 70 81) no Hoare annotation was computed. [2022-02-20 18:11:37,625 INFO L858 garLoopResultBuilder]: For program point L74-1(lines 70 81) no Hoare annotation was computed. [2022-02-20 18:11:37,626 INFO L861 garLoopResultBuilder]: At program point waterRiseENTRY(lines 70 81) the Hoare annotation is: true [2022-02-20 18:11:37,626 INFO L858 garLoopResultBuilder]: For program point isPumpRunningEXIT(lines 340 348) no Hoare annotation was computed. [2022-02-20 18:11:37,626 INFO L861 garLoopResultBuilder]: At program point isPumpRunningENTRY(lines 340 348) the Hoare annotation is: true [2022-02-20 18:11:37,626 INFO L858 garLoopResultBuilder]: For program point isPumpRunningFINAL(lines 340 348) no Hoare annotation was computed. [2022-02-20 18:11:37,629 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 18:11:37,630 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:11:37,633 WARN L170 areAnnotationChecker]: processEnvironment__wrappee__baseEXIT has no Hoare annotation [2022-02-20 18:11:37,633 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 18:11:37,633 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 18:11:37,634 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 18:11:37,634 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 18:11:37,635 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 18:11:37,635 WARN L170 areAnnotationChecker]: isPumpRunningFINAL has no Hoare annotation [2022-02-20 18:11:37,635 WARN L170 areAnnotationChecker]: processEnvironment__wrappee__baseEXIT has no Hoare annotation [2022-02-20 18:11:37,635 WARN L170 areAnnotationChecker]: processEnvironment__wrappee__baseEXIT has no Hoare annotation [2022-02-20 18:11:37,635 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 18:11:37,635 WARN L170 areAnnotationChecker]: L401-1 has no Hoare annotation [2022-02-20 18:11:37,636 WARN L170 areAnnotationChecker]: L507-1 has no Hoare annotation [2022-02-20 18:11:37,636 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 18:11:37,636 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 18:11:37,636 WARN L170 areAnnotationChecker]: isPumpRunningFINAL has no Hoare annotation [2022-02-20 18:11:37,636 WARN L170 areAnnotationChecker]: L267-1 has no Hoare annotation [2022-02-20 18:11:37,637 WARN L170 areAnnotationChecker]: changeMethaneLevelEXIT has no Hoare annotation [2022-02-20 18:11:37,637 WARN L170 areAnnotationChecker]: L401-1 has no Hoare annotation [2022-02-20 18:11:37,637 WARN L170 areAnnotationChecker]: L507-1 has no Hoare annotation [2022-02-20 18:11:37,637 WARN L170 areAnnotationChecker]: waterRiseEXIT has no Hoare annotation [2022-02-20 18:11:37,637 WARN L170 areAnnotationChecker]: isPumpRunningEXIT has no Hoare annotation [2022-02-20 18:11:37,637 WARN L170 areAnnotationChecker]: isPumpRunningEXIT has no Hoare annotation [2022-02-20 18:11:37,638 WARN L170 areAnnotationChecker]: L267-1 has no Hoare annotation [2022-02-20 18:11:37,638 WARN L170 areAnnotationChecker]: L207-1 has no Hoare annotation [2022-02-20 18:11:37,638 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-02-20 18:11:37,638 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2022-02-20 18:11:37,638 WARN L170 areAnnotationChecker]: L197-1 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: cleanupEXIT has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2022-02-20 18:11:37,639 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L478 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-02-20 18:11:37,640 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: cleanupEXIT has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: L409 has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: L409 has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 18:11:37,641 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L260-2 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L260-2 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L478 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L478 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L207-1 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L525 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L525 has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: timeShiftFINAL has no Hoare annotation [2022-02-20 18:11:37,642 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2022-02-20 18:11:37,643 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-02-20 18:11:37,644 WARN L170 areAnnotationChecker]: L260-2 has no Hoare annotation [2022-02-20 18:11:37,644 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2022-02-20 18:11:37,644 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2022-02-20 18:11:37,644 WARN L170 areAnnotationChecker]: L478-2 has no Hoare annotation [2022-02-20 18:11:37,645 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2022-02-20 18:11:37,645 WARN L170 areAnnotationChecker]: L912 has no Hoare annotation [2022-02-20 18:11:37,645 WARN L170 areAnnotationChecker]: timeShiftFINAL has no Hoare annotation [2022-02-20 18:11:37,645 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 18:11:37,646 WARN L170 areAnnotationChecker]: L478-2 has no Hoare annotation [2022-02-20 18:11:37,646 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-02-20 18:11:37,647 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:11:37,647 WARN L170 areAnnotationChecker]: timeShiftEXIT has no Hoare annotation [2022-02-20 18:11:37,647 WARN L170 areAnnotationChecker]: timeShiftEXIT has no Hoare annotation [2022-02-20 18:11:37,647 WARN L170 areAnnotationChecker]: timeShiftEXIT has no Hoare annotation [2022-02-20 18:11:37,647 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 18:11:37,647 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 18:11:37,648 WARN L170 areAnnotationChecker]: L197 has no Hoare annotation [2022-02-20 18:11:37,649 WARN L170 areAnnotationChecker]: L197-1 has no Hoare annotation [2022-02-20 18:11:37,649 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 18:11:37,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 06:11:37 BoogieIcfgContainer [2022-02-20 18:11:37,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 18:11:37,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 18:11:37,663 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 18:11:37,663 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 18:11:37,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:11:35" (3/4) ... [2022-02-20 18:11:37,666 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 18:11:37,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2022-02-20 18:11:37,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2022-02-20 18:11:37,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2022-02-20 18:11:37,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2022-02-20 18:11:37,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2022-02-20 18:11:37,670 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2022-02-20 18:11:37,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2022-02-20 18:11:37,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-02-20 18:11:37,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 18:11:37,676 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 18:11:37,677 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 18:11:37,677 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:11:37,677 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 18:11:37,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (pumpRunning == 0 && \result == 1) && !(0 == systemActive) [2022-02-20 18:11:37,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((pumpRunning == 0 && \result == 1) && tmp == 1) && !(0 == systemActive) [2022-02-20 18:11:37,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((pumpRunning == 0 && \result == 1) && tmp == 1) && !(0 == systemActive) [2022-02-20 18:11:37,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((pumpRunning == 0 && \result == 1) && splverifierCounter == 0) && tmp == 1) && !(0 == systemActive) [2022-02-20 18:11:37,698 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive [2022-02-20 18:11:37,698 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(pumpRunning) == 0) || 0 == systemActive [2022-02-20 18:11:37,698 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((pumpRunning == 0 && \result == 1) && splverifierCounter == 0) && tmp == 1) && !(0 == systemActive) [2022-02-20 18:11:37,698 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive [2022-02-20 18:11:37,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive [2022-02-20 18:11:37,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(pumpRunning) == 0) || 0 == systemActive [2022-02-20 18:11:37,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive [2022-02-20 18:11:37,699 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(pumpRunning) == 0) || 0 == systemActive [2022-02-20 18:11:37,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(pumpRunning) == 0) || 0 == systemActive [2022-02-20 18:11:37,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(pumpRunning) == 0) || 0 == systemActive [2022-02-20 18:11:37,714 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 18:11:37,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 18:11:37,716 INFO L158 Benchmark]: Toolchain (without parser) took 3500.71ms. Allocated memory was 81.8MB in the beginning and 180.4MB in the end (delta: 98.6MB). Free memory was 55.0MB in the beginning and 106.6MB in the end (delta: -51.6MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,716 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:11:37,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.56ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 54.7MB in the beginning and 79.1MB in the end (delta: -24.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.15ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 76.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,717 INFO L158 Benchmark]: Boogie Preprocessor took 41.94ms. Allocated memory is still 115.3MB. Free memory was 76.4MB in the beginning and 74.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,717 INFO L158 Benchmark]: RCFGBuilder took 405.09ms. Allocated memory is still 115.3MB. Free memory was 74.7MB in the beginning and 56.1MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,718 INFO L158 Benchmark]: TraceAbstraction took 2377.24ms. Allocated memory was 115.3MB in the beginning and 180.4MB in the end (delta: 65.0MB). Free memory was 92.7MB in the beginning and 111.8MB in the end (delta: -19.2MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,718 INFO L158 Benchmark]: Witness Printer took 52.37ms. Allocated memory is still 180.4MB. Free memory was 111.8MB in the beginning and 106.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:11:37,719 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.19ms. Allocated memory is still 81.8MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.56ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 54.7MB in the beginning and 79.1MB in the end (delta: -24.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.15ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 76.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.94ms. Allocated memory is still 115.3MB. Free memory was 76.4MB in the beginning and 74.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 405.09ms. Allocated memory is still 115.3MB. Free memory was 74.7MB in the beginning and 56.1MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2377.24ms. Allocated memory was 115.3MB in the beginning and 180.4MB in the end (delta: 65.0MB). Free memory was 92.7MB in the beginning and 111.8MB in the end (delta: -19.2MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 52.37ms. Allocated memory is still 180.4MB. Free memory was 111.8MB in the beginning and 106.6MB in the end (delta: 5.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: 912]: 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 7 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 601 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 294 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 163 PreInvPairs, 178 NumberOfFragments, 289 HoareAnnotationTreeSize, 163 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 37 FomulaSimplificationsInter, 111 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 12/12 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: 321]: Loop Invariant Derived loop invariant: !(\old(pumpRunning) == 0) || 0 == systemActive - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: !(\old(pumpRunning) == 0) || 0 == systemActive - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: !(\old(pumpRunning) == 0) || 0 == systemActive - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: pumpRunning == 0 && !(0 == systemActive) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: (((pumpRunning == 0 && \result == 1) && splverifierCounter == 0) && tmp == 1) && !(0 == systemActive) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (pumpRunning == 0 && \result == 1) && !(0 == systemActive) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((pumpRunning == 0 && \result == 1) && tmp == 1) && !(0 == systemActive) - InvariantResult [Line: 494]: Loop Invariant Derived loop invariant: ((pumpRunning == 0 && \result == 1) && tmp == 1) && !(0 == systemActive) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: !(\old(pumpRunning) == 0) || 0 == systemActive - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: pumpRunning == 0 && !(0 == systemActive) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 468]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: (!(\old(pumpRunning) == 0) || pumpRunning == 0) || 0 == systemActive - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((pumpRunning == 0 && \result == 1) && splverifierCounter == 0) && tmp == 1) && !(0 == systemActive) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: !(\old(pumpRunning) == 0) || 0 == systemActive RESULT: Ultimate proved your program to be correct! [2022-02-20 18:11:37,778 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