./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae076af2cea67b9cfc404edc1600766999266c2b24082e43516a66dae23512b8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:15:22,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:15:22,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:15:22,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:15:22,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:15:22,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:15:22,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:15:22,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:15:22,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:15:22,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:15:22,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:15:22,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:15:22,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:15:22,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:15:22,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:15:22,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:15:22,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:15:22,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:15:22,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:15:22,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:15:22,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:15:22,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:15:22,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:15:22,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:15:22,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:15:22,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:15:22,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:15:22,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:15:22,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:15:22,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:15:22,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:15:22,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:15:22,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:15:22,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:15:22,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:15:22,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:15:22,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:15:22,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:15:22,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:15:22,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:15:22,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:15:22,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:15:22,687 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:15:22,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:15:22,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:15:22,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:15:22,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:15:22,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:15:22,693 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:15:22,693 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:15:22,693 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:15:22,693 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:15:22,694 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:15:22,694 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:15:22,695 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:15:22,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:15:22,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:15:22,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:15:22,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:15:22,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:15:22,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:15:22,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:15:22,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:15:22,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:15:22,696 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:15:22,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:15:22,698 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:15:22,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:15:22,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:15:22,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:15:22,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:15:22,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:15:22,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:15:22,700 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:15:22,700 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> ae076af2cea67b9cfc404edc1600766999266c2b24082e43516a66dae23512b8 [2022-02-21 04:15:22,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:15:22,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:15:22,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:15:22,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:15:22,914 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:15:22,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2022-02-21 04:15:23,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55ede0a3/07d3a14378784ce4833ef957ad274670/FLAG00a3a24b5 [2022-02-21 04:15:23,395 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:15:23,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product33.cil.c [2022-02-21 04:15:23,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55ede0a3/07d3a14378784ce4833ef957ad274670/FLAG00a3a24b5 [2022-02-21 04:15:23,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55ede0a3/07d3a14378784ce4833ef957ad274670 [2022-02-21 04:15:23,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:15:23,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:15:23,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:15:23,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:15:23,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:15:23,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c45ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23, skipping insertion in model container [2022-02-21 04:15:23,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:15:23,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:15:23,652 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_spec1_product33.cil.c[11292,11305] [2022-02-21 04:15:23,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:15:23,698 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:15:23,782 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_spec1_product33.cil.c[11292,11305] [2022-02-21 04:15:23,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:15:23,815 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:15:23,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23 WrapperNode [2022-02-21 04:15:23,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:15:23,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:15:23,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:15:23,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:15:23,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,885 INFO L137 Inliner]: procedures = 52, calls = 149, calls flagged for inlining = 46, calls inlined = 47, statements flattened = 389 [2022-02-21 04:15:23,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:15:23,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:15:23,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:15:23,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:15:23,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:15:23,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:15:23,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:15:23,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:15:23,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (1/1) ... [2022-02-21 04:15:23,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:15:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:15:23,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:15:23,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:15:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:15:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:15:23,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:15:23,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:15:24,028 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:15:24,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:15:24,313 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:15:24,318 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:15:24,318 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:15:24,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:15:24 BoogieIcfgContainer [2022-02-21 04:15:24,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:15:24,320 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:15:24,320 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:15:24,323 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:15:24,323 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:15:24,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:15:23" (1/3) ... [2022-02-21 04:15:24,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d1e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:15:24, skipping insertion in model container [2022-02-21 04:15:24,325 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:15:24,325 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:23" (2/3) ... [2022-02-21 04:15:24,325 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75d1e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:15:24, skipping insertion in model container [2022-02-21 04:15:24,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:15:24,326 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:15:24" (3/3) ... [2022-02-21 04:15:24,327 INFO L388 chiAutomizerObserver]: Analyzing ICFG minepump_spec1_product33.cil.c [2022-02-21 04:15:24,358 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:15:24,359 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:15:24,359 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:15:24,359 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:15:24,359 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:15:24,359 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:15:24,359 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:15:24,359 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:15:24,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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-21 04:15:24,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-02-21 04:15:24,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:24,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:24,439 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:24,439 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:24,439 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:15:24,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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-21 04:15:24,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-02-21 04:15:24,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:24,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:24,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:24,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:24,469 INFO L791 eck$LassoCheckResult]: Stem: 96#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 32#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1, main_~retValue_acc~8#1, main_~tmp~6#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~6#1;assume { :begin_inline_select_helpers } true; 99#L680true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 23#L673true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 78#L688true main_#t~ret43#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret43#1;havoc main_#t~ret43#1; 15#L775true assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true; 53#L752true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_#t~nondet41#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 86#L600-2true [2022-02-21 04:15:24,470 INFO L793 eck$LassoCheckResult]: Loop: 86#L600-2true assume !false; 45#L601true assume test_~splverifierCounter~0#1 < 4; 7#L602true test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; 40#L610true assume !(0 != test_~tmp~5#1); 41#L610-2true test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; 42#L620true assume !(0 != test_~tmp___0~1#1); 29#L620-2true test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; 59#L630true assume 0 != test_~tmp___2~0#1; 83#L636-2true assume { :begin_inline_timeShift } true; 22#L442true assume !(0 != ~pumpRunning~0); 79#L442-2true assume !(0 != ~systemActive~0); 74#L449-1true assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; 93#L859true __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; 64#L797true assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); 62#L797-1true assume { :end_inline___utac_acc__Specification1_spec__1 } true; 6#L459true assume { :end_inline_timeShift } true; 86#L600-2true [2022-02-21 04:15:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:24,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 1 times [2022-02-21 04:15:24,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:24,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081918044] [2022-02-21 04:15:24,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:24,658 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:24,704 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash -680968892, now seen corresponding path program 1 times [2022-02-21 04:15:24,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:24,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261063994] [2022-02-21 04:15:24,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:24,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:24,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:24,747 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 674450184, now seen corresponding path program 1 times [2022-02-21 04:15:24,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:24,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537411865] [2022-02-21 04:15:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:24,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {115#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:15:24,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1, main_~retValue_acc~8#1, main_~tmp~6#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~6#1;assume { :begin_inline_select_helpers } true; {115#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:15:24,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {115#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:15:24,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {115#(= 1 ~systemActive~0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {116#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-21 04:15:24,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {116#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret43#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret43#1;havoc main_#t~ret43#1; {117#(= |ULTIMATE.start_main_~tmp~6#1| ~systemActive~0)} is VALID [2022-02-21 04:15:24,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(= |ULTIMATE.start_main_~tmp~6#1| ~systemActive~0)} assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_#t~nondet41#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !false; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {118#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#(not (= 0 ~systemActive~0))} test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~5#1); {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {118#(not (= 0 ~systemActive~0))} test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~1#1); {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {118#(not (= 0 ~systemActive~0))} test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {118#(not (= 0 ~systemActive~0))} assume 0 != test_~tmp___2~0#1; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {118#(not (= 0 ~systemActive~0))} assume { :begin_inline_timeShift } true; {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {118#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:24,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {118#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {114#false} is VALID [2022-02-21 04:15:24,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {114#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; {114#false} is VALID [2022-02-21 04:15:24,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {114#false} __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; {114#false} is VALID [2022-02-21 04:15:24,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {114#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); {114#false} is VALID [2022-02-21 04:15:24,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {114#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {114#false} is VALID [2022-02-21 04:15:24,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {114#false} assume { :end_inline_timeShift } true; {114#false} is VALID [2022-02-21 04:15:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:15:24,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:24,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537411865] [2022-02-21 04:15:24,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537411865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:24,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:24,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:15:24,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273509565] [2022-02-21 04:15:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:25,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:15:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:15:25,056 INFO L87 Difference]: Start difference. First operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 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 has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-21 04:15:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:25,330 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2022-02-21 04:15:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:15:25,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-21 04:15:25,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:15:25,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 130 transitions. [2022-02-21 04:15:25,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-02-21 04:15:25,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 92 states and 120 transitions. [2022-02-21 04:15:25,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-02-21 04:15:25,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2022-02-21 04:15:25,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 120 transitions. [2022-02-21 04:15:25,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:25,374 INFO L681 BuchiCegarLoop]: Abstraction has 92 states and 120 transitions. [2022-02-21 04:15:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 120 transitions. [2022-02-21 04:15:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-21 04:15:25,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:25,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states and 120 transitions. Second operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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-21 04:15:25,403 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states and 120 transitions. Second operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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-21 04:15:25,404 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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-21 04:15:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:25,413 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-02-21 04:15:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-02-21 04:15:25,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:25,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:25,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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 92 states and 120 transitions. [2022-02-21 04:15:25,415 INFO L87 Difference]: Start difference. First operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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 92 states and 120 transitions. [2022-02-21 04:15:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:25,421 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-02-21 04:15:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2022-02-21 04:15:25,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:25,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:25,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:25,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 91 states have internal predecessors, (120), 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-21 04:15:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2022-02-21 04:15:25,427 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 120 transitions. [2022-02-21 04:15:25,427 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 120 transitions. [2022-02-21 04:15:25,427 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:15:25,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 120 transitions. [2022-02-21 04:15:25,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-02-21 04:15:25,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:25,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:25,429 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:25,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:25,430 INFO L791 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1, main_~retValue_acc~8#1, main_~tmp~6#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~6#1;assume { :begin_inline_select_helpers } true; 301#L680 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 281#L673 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 282#L688 main_#t~ret43#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret43#1;havoc main_#t~ret43#1; 266#L775 assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true; 225#L752 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_#t~nondet41#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 226#L600-2 [2022-02-21 04:15:25,430 INFO L793 eck$LassoCheckResult]: Loop: 226#L600-2 assume !false; 299#L601 assume test_~splverifierCounter~0#1 < 4; 240#L602 test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; 241#L610 assume !(0 != test_~tmp~5#1); 310#L610-2 test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; 311#L620 assume !(0 != test_~tmp___0~1#1); 277#L620-2 test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; 251#L630 assume 0 != test_~tmp___2~0#1; 253#L636-2 assume { :begin_inline_timeShift } true; 278#L442 assume !(0 != ~pumpRunning~0); 279#L442-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; 293#L474 assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; 227#L466-1 assume { :end_inline_processEnvironment__wrappee__base } true; 228#L474-1 assume { :end_inline_processEnvironment } true; 248#L449-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; 283#L859 __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; 262#L797 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); 255#L797-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 234#L459 assume { :end_inline_timeShift } true; 226#L600-2 [2022-02-21 04:15:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 2 times [2022-02-21 04:15:25,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:25,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730510396] [2022-02-21 04:15:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:25,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:25,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:25,477 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash -232248349, now seen corresponding path program 1 times [2022-02-21 04:15:25,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:25,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392835107] [2022-02-21 04:15:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:25,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#true} assume !false; {506#true} is VALID [2022-02-21 04:15:25,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#true} assume test_~splverifierCounter~0#1 < 4; {506#true} is VALID [2022-02-21 04:15:25,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {506#true} is VALID [2022-02-21 04:15:25,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#true} assume !(0 != test_~tmp~5#1); {506#true} is VALID [2022-02-21 04:15:25,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#true} test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {506#true} is VALID [2022-02-21 04:15:25,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#true} assume !(0 != test_~tmp___0~1#1); {506#true} is VALID [2022-02-21 04:15:25,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#true} test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {506#true} is VALID [2022-02-21 04:15:25,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#true} assume 0 != test_~tmp___2~0#1; {506#true} is VALID [2022-02-21 04:15:25,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#true} assume { :begin_inline_timeShift } true; {506#true} is VALID [2022-02-21 04:15:25,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#true} assume !(0 != ~pumpRunning~0); {508#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:15:25,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(= ~pumpRunning~0 0)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; {508#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:15:25,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(= ~pumpRunning~0 0)} assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; {507#false} is VALID [2022-02-21 04:15:25,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#false} assume { :end_inline_processEnvironment__wrappee__base } true; {507#false} is VALID [2022-02-21 04:15:25,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#false} assume { :end_inline_processEnvironment } true; {507#false} is VALID [2022-02-21 04:15:25,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; {507#false} is VALID [2022-02-21 04:15:25,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#false} __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; {507#false} is VALID [2022-02-21 04:15:25,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); {507#false} is VALID [2022-02-21 04:15:25,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {507#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {507#false} is VALID [2022-02-21 04:15:25,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {507#false} assume { :end_inline_timeShift } true; {507#false} is VALID [2022-02-21 04:15:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:15:25,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:25,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392835107] [2022-02-21 04:15:25,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392835107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:25,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:25,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:15:25,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83259201] [2022-02-21 04:15:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:25,507 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:15:25,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:15:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:15:25,508 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-21 04:15:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:25,665 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-02-21 04:15:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:15:25,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-21 04:15:25,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:15:25,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 182 transitions. [2022-02-21 04:15:25,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 102 [2022-02-21 04:15:25,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 182 transitions. [2022-02-21 04:15:25,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2022-02-21 04:15:25,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2022-02-21 04:15:25,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 182 transitions. [2022-02-21 04:15:25,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:25,690 INFO L681 BuchiCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-02-21 04:15:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 182 transitions. [2022-02-21 04:15:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-02-21 04:15:25,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:25,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states and 182 transitions. Second operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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-21 04:15:25,697 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states and 182 transitions. Second operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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-21 04:15:25,698 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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-21 04:15:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:25,702 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-02-21 04:15:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2022-02-21 04:15:25,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:25,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:25,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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 144 states and 182 transitions. [2022-02-21 04:15:25,707 INFO L87 Difference]: Start difference. First operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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 144 states and 182 transitions. [2022-02-21 04:15:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:25,710 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2022-02-21 04:15:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2022-02-21 04:15:25,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:25,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:25,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:25,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 144 states have (on average 1.2638888888888888) internal successors, (182), 143 states have internal predecessors, (182), 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-21 04:15:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2022-02-21 04:15:25,715 INFO L704 BuchiCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-02-21 04:15:25,716 INFO L587 BuchiCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-02-21 04:15:25,716 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:15:25,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 182 transitions. [2022-02-21 04:15:25,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 102 [2022-02-21 04:15:25,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:25,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:25,721 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:25,721 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:25,721 INFO L791 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 729#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1, main_~retValue_acc~8#1, main_~tmp~6#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~6#1;assume { :begin_inline_select_helpers } true; 730#L680 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 709#L673 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 710#L688 main_#t~ret43#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret43#1;havoc main_#t~ret43#1; 693#L775 assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true; 653#L752 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_#t~nondet41#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 654#L600-2 [2022-02-21 04:15:25,722 INFO L793 eck$LassoCheckResult]: Loop: 654#L600-2 assume !false; 728#L601 assume test_~splverifierCounter~0#1 < 4; 748#L602 test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; 793#L610 assume !(0 != test_~tmp~5#1); 791#L610-2 test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; 745#L620 assume !(0 != test_~tmp___0~1#1); 706#L620-2 test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; 678#L630 assume 0 != test_~tmp___2~0#1; 680#L636-2 assume { :begin_inline_timeShift } true; 707#L442 assume !(0 != ~pumpRunning~0); 708#L442-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; 722#L474 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret37#1, isHighWaterLevel_~retValue_acc~5#1, isHighWaterLevel_~tmp~4#1, isHighWaterLevel_~tmp___0~0#1;havoc isHighWaterLevel_~retValue_acc~5#1;havoc isHighWaterLevel_~tmp~4#1;havoc isHighWaterLevel_~tmp___0~0#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~11#1;havoc isHighWaterSensorDry_~retValue_acc~11#1; 732#L899 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; 699#L904 isHighWaterLevel_#t~ret37#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~4#1 := isHighWaterLevel_#t~ret37#1;havoc isHighWaterLevel_#t~ret37#1; 696#L576 assume 0 != isHighWaterLevel_~tmp~4#1;isHighWaterLevel_~tmp___0~0#1 := 0; 697#L576-2 isHighWaterLevel_~retValue_acc~5#1 := isHighWaterLevel_~tmp___0~0#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; 733#L582 processEnvironment_#t~ret27#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~3#1 := processEnvironment_#t~ret27#1;havoc processEnvironment_#t~ret27#1; 752#L478 assume !(0 != processEnvironment_~tmp~3#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 753#L466 assume { :end_inline_processEnvironment__wrappee__base } true; 754#L474-1 assume { :end_inline_processEnvironment } true; 796#L449-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; 795#L859 __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; 689#L797 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); 682#L797-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 662#L459 assume { :end_inline_timeShift } true; 654#L600-2 [2022-02-21 04:15:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 3 times [2022-02-21 04:15:25,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:25,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249647061] [2022-02-21 04:15:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:25,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:25,749 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1748467795, now seen corresponding path program 1 times [2022-02-21 04:15:25,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:25,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927921546] [2022-02-21 04:15:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:25,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {1090#true} assume !false; {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume test_~splverifierCounter~0#1 < 4; {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {1090#true} assume !(0 != test_~tmp~5#1); {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {1090#true} test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} assume !(0 != test_~tmp___0~1#1); {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {1090#true} test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {1090#true} is VALID [2022-02-21 04:15:25,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {1090#true} assume 0 != test_~tmp___2~0#1; {1090#true} is VALID [2022-02-21 04:15:25,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {1090#true} assume { :begin_inline_timeShift } true; {1090#true} is VALID [2022-02-21 04:15:25,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {1090#true} assume !(0 != ~pumpRunning~0); {1090#true} is VALID [2022-02-21 04:15:25,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {1090#true} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; {1090#true} is VALID [2022-02-21 04:15:25,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {1090#true} assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret37#1, isHighWaterLevel_~retValue_acc~5#1, isHighWaterLevel_~tmp~4#1, isHighWaterLevel_~tmp___0~0#1;havoc isHighWaterLevel_~retValue_acc~5#1;havoc isHighWaterLevel_~tmp~4#1;havoc isHighWaterLevel_~tmp___0~0#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~11#1;havoc isHighWaterSensorDry_~retValue_acc~11#1; {1090#true} is VALID [2022-02-21 04:15:25,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#true} assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; {1092#(= |ULTIMATE.start_isHighWaterSensorDry_#res#1| 0)} is VALID [2022-02-21 04:15:25,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#(= |ULTIMATE.start_isHighWaterSensorDry_#res#1| 0)} isHighWaterLevel_#t~ret37#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~4#1 := isHighWaterLevel_#t~ret37#1;havoc isHighWaterLevel_#t~ret37#1; {1093#(= |ULTIMATE.start_isHighWaterLevel_~tmp~4#1| 0)} is VALID [2022-02-21 04:15:25,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#(= |ULTIMATE.start_isHighWaterLevel_~tmp~4#1| 0)} assume 0 != isHighWaterLevel_~tmp~4#1;isHighWaterLevel_~tmp___0~0#1 := 0; {1091#false} is VALID [2022-02-21 04:15:25,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#false} isHighWaterLevel_~retValue_acc~5#1 := isHighWaterLevel_~tmp___0~0#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} processEnvironment_#t~ret27#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~3#1 := processEnvironment_#t~ret27#1;havoc processEnvironment_#t~ret27#1; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume !(0 != processEnvironment_~tmp~3#1);assume { :begin_inline_processEnvironment__wrappee__base } true; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {1091#false} assume { :end_inline_processEnvironment__wrappee__base } true; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1091#false} assume { :end_inline_processEnvironment } true; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#false} __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; {1091#false} is VALID [2022-02-21 04:15:25,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); {1091#false} is VALID [2022-02-21 04:15:25,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1091#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {1091#false} is VALID [2022-02-21 04:15:25,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1091#false} assume { :end_inline_timeShift } true; {1091#false} is VALID [2022-02-21 04:15:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:15:25,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:25,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927921546] [2022-02-21 04:15:25,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927921546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:25,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:25,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:15:25,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630556764] [2022-02-21 04:15:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:25,792 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:15:25,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:15:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:15:25,792 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. cyclomatic complexity: 40 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-21 04:15:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:26,098 INFO L93 Difference]: Finished difference Result 406 states and 508 transitions. [2022-02-21 04:15:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:15:26,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-21 04:15:26,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:15:26,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 406 states and 508 transitions. [2022-02-21 04:15:26,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 298 [2022-02-21 04:15:26,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 406 states to 406 states and 508 transitions. [2022-02-21 04:15:26,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2022-02-21 04:15:26,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 [2022-02-21 04:15:26,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 406 states and 508 transitions. [2022-02-21 04:15:26,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:26,139 INFO L681 BuchiCegarLoop]: Abstraction has 406 states and 508 transitions. [2022-02-21 04:15:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states and 508 transitions. [2022-02-21 04:15:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 150. [2022-02-21 04:15:26,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:26,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states and 508 transitions. Second operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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-21 04:15:26,147 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states and 508 transitions. Second operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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-21 04:15:26,147 INFO L87 Difference]: Start difference. First operand 406 states and 508 transitions. Second operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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-21 04:15:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:26,156 INFO L93 Difference]: Finished difference Result 406 states and 508 transitions. [2022-02-21 04:15:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 508 transitions. [2022-02-21 04:15:26,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:26,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:26,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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 406 states and 508 transitions. [2022-02-21 04:15:26,157 INFO L87 Difference]: Start difference. First operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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 406 states and 508 transitions. [2022-02-21 04:15:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:26,166 INFO L93 Difference]: Finished difference Result 406 states and 508 transitions. [2022-02-21 04:15:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 508 transitions. [2022-02-21 04:15:26,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:26,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:26,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:26,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 149 states have internal predecessors, (188), 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-21 04:15:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2022-02-21 04:15:26,170 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 188 transitions. [2022-02-21 04:15:26,170 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 188 transitions. [2022-02-21 04:15:26,170 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:15:26,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 188 transitions. [2022-02-21 04:15:26,171 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2022-02-21 04:15:26,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:26,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:26,172 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:26,172 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:26,172 INFO L791 eck$LassoCheckResult]: Stem: 1597#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 1583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1, main_~retValue_acc~8#1, main_~tmp~6#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~6#1;assume { :begin_inline_select_helpers } true; 1584#L680 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 1563#L673 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 1564#L688 main_#t~ret43#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret43#1;havoc main_#t~ret43#1; 1545#L775 assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true; 1503#L752 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_#t~nondet41#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 1504#L600-2 [2022-02-21 04:15:26,172 INFO L793 eck$LassoCheckResult]: Loop: 1504#L600-2 assume !false; 1585#L601 assume test_~splverifierCounter~0#1 < 4; 1517#L602 test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; 1518#L610 assume !(0 != test_~tmp~5#1); 1598#L610-2 test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; 1600#L620 assume !(0 != test_~tmp___0~1#1); 1559#L620-2 test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; 1529#L630 assume 0 != test_~tmp___2~0#1; 1531#L636-2 assume { :begin_inline_timeShift } true; 1560#L442 assume !(0 != ~pumpRunning~0); 1561#L442-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; 1576#L474 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret37#1, isHighWaterLevel_~retValue_acc~5#1, isHighWaterLevel_~tmp~4#1, isHighWaterLevel_~tmp___0~0#1;havoc isHighWaterLevel_~retValue_acc~5#1;havoc isHighWaterLevel_~tmp~4#1;havoc isHighWaterLevel_~tmp___0~0#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~11#1;havoc isHighWaterSensorDry_~retValue_acc~11#1; 1587#L899 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; 1588#L904 isHighWaterLevel_#t~ret37#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~4#1 := isHighWaterLevel_#t~ret37#1;havoc isHighWaterLevel_#t~ret37#1; 1548#L576 assume !(0 != isHighWaterLevel_~tmp~4#1);isHighWaterLevel_~tmp___0~0#1 := 1; 1549#L576-2 isHighWaterLevel_~retValue_acc~5#1 := isHighWaterLevel_~tmp___0~0#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; 1589#L582 processEnvironment_#t~ret27#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~3#1 := processEnvironment_#t~ret27#1;havoc processEnvironment_#t~ret27#1; 1606#L478 assume !(0 != processEnvironment_~tmp~3#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 1607#L466 assume { :end_inline_processEnvironment__wrappee__base } true; 1525#L474-1 assume { :end_inline_processEnvironment } true; 1526#L449-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; 1565#L859 __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; 1541#L797 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); 1534#L797-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 1512#L459 assume { :end_inline_timeShift } true; 1504#L600-2 [2022-02-21 04:15:26,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 4 times [2022-02-21 04:15:26,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:26,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881850736] [2022-02-21 04:15:26,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,192 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1047403217, now seen corresponding path program 1 times [2022-02-21 04:15:26,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:26,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750625454] [2022-02-21 04:15:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:26,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {2470#true} assume !false; {2470#true} is VALID [2022-02-21 04:15:26,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {2470#true} assume test_~splverifierCounter~0#1 < 4; {2470#true} is VALID [2022-02-21 04:15:26,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2470#true} test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {2470#true} is VALID [2022-02-21 04:15:26,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {2470#true} assume !(0 != test_~tmp~5#1); {2470#true} is VALID [2022-02-21 04:15:26,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {2470#true} test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {2470#true} is VALID [2022-02-21 04:15:26,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {2470#true} assume !(0 != test_~tmp___0~1#1); {2470#true} is VALID [2022-02-21 04:15:26,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {2470#true} test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; {2470#true} is VALID [2022-02-21 04:15:26,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {2470#true} assume 0 != test_~tmp___2~0#1; {2470#true} is VALID [2022-02-21 04:15:26,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {2470#true} assume { :begin_inline_timeShift } true; {2470#true} is VALID [2022-02-21 04:15:26,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {2470#true} assume !(0 != ~pumpRunning~0); {2470#true} is VALID [2022-02-21 04:15:26,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {2470#true} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; {2470#true} is VALID [2022-02-21 04:15:26,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {2470#true} assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret37#1, isHighWaterLevel_~retValue_acc~5#1, isHighWaterLevel_~tmp~4#1, isHighWaterLevel_~tmp___0~0#1;havoc isHighWaterLevel_~retValue_acc~5#1;havoc isHighWaterLevel_~tmp~4#1;havoc isHighWaterLevel_~tmp___0~0#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~11#1;havoc isHighWaterSensorDry_~retValue_acc~11#1; {2470#true} is VALID [2022-02-21 04:15:26,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {2470#true} assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~11#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; {2470#true} is VALID [2022-02-21 04:15:26,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {2470#true} isHighWaterLevel_#t~ret37#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~4#1 := isHighWaterLevel_#t~ret37#1;havoc isHighWaterLevel_#t~ret37#1; {2470#true} is VALID [2022-02-21 04:15:26,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {2470#true} assume !(0 != isHighWaterLevel_~tmp~4#1);isHighWaterLevel_~tmp___0~0#1 := 1; {2472#(<= 1 |ULTIMATE.start_isHighWaterLevel_~tmp___0~0#1|)} is VALID [2022-02-21 04:15:26,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(<= 1 |ULTIMATE.start_isHighWaterLevel_~tmp___0~0#1|)} isHighWaterLevel_~retValue_acc~5#1 := isHighWaterLevel_~tmp___0~0#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; {2473#(<= 1 |ULTIMATE.start_isHighWaterLevel_#res#1|)} is VALID [2022-02-21 04:15:26,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {2473#(<= 1 |ULTIMATE.start_isHighWaterLevel_#res#1|)} processEnvironment_#t~ret27#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~3#1 := processEnvironment_#t~ret27#1;havoc processEnvironment_#t~ret27#1; {2474#(<= 1 |ULTIMATE.start_processEnvironment_~tmp~3#1|)} is VALID [2022-02-21 04:15:26,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {2474#(<= 1 |ULTIMATE.start_processEnvironment_~tmp~3#1|)} assume !(0 != processEnvironment_~tmp~3#1);assume { :begin_inline_processEnvironment__wrappee__base } true; {2471#false} is VALID [2022-02-21 04:15:26,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {2471#false} assume { :end_inline_processEnvironment__wrappee__base } true; {2471#false} is VALID [2022-02-21 04:15:26,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {2471#false} assume { :end_inline_processEnvironment } true; {2471#false} is VALID [2022-02-21 04:15:26,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {2471#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; {2471#false} is VALID [2022-02-21 04:15:26,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {2471#false} __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; {2471#false} is VALID [2022-02-21 04:15:26,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {2471#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); {2471#false} is VALID [2022-02-21 04:15:26,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {2471#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {2471#false} is VALID [2022-02-21 04:15:26,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {2471#false} assume { :end_inline_timeShift } true; {2471#false} is VALID [2022-02-21 04:15:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:15:26,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:26,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750625454] [2022-02-21 04:15:26,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750625454] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:26,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:26,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:15:26,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523124456] [2022-02-21 04:15:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:26,227 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:15:26,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:26,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:15:26,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:15:26,227 INFO L87 Difference]: Start difference. First operand 150 states and 188 transitions. cyclomatic complexity: 40 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-21 04:15:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:26,599 INFO L93 Difference]: Finished difference Result 287 states and 360 transitions. [2022-02-21 04:15:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:15:26,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-21 04:15:26,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:15:26,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 360 transitions. [2022-02-21 04:15:26,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 208 [2022-02-21 04:15:26,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 287 states and 360 transitions. [2022-02-21 04:15:26,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 287 [2022-02-21 04:15:26,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 287 [2022-02-21 04:15:26,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 360 transitions. [2022-02-21 04:15:26,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:26,627 INFO L681 BuchiCegarLoop]: Abstraction has 287 states and 360 transitions. [2022-02-21 04:15:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 360 transitions. [2022-02-21 04:15:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 159. [2022-02-21 04:15:26,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:26,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states and 360 transitions. Second operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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-21 04:15:26,631 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states and 360 transitions. Second operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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-21 04:15:26,631 INFO L87 Difference]: Start difference. First operand 287 states and 360 transitions. Second operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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-21 04:15:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:26,636 INFO L93 Difference]: Finished difference Result 287 states and 360 transitions. [2022-02-21 04:15:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 360 transitions. [2022-02-21 04:15:26,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:26,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:26,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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 287 states and 360 transitions. [2022-02-21 04:15:26,637 INFO L87 Difference]: Start difference. First operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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 287 states and 360 transitions. [2022-02-21 04:15:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:26,643 INFO L93 Difference]: Finished difference Result 287 states and 360 transitions. [2022-02-21 04:15:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 360 transitions. [2022-02-21 04:15:26,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:26,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:26,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:26,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.2389937106918238) internal successors, (197), 158 states have internal predecessors, (197), 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-21 04:15:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2022-02-21 04:15:26,646 INFO L704 BuchiCegarLoop]: Abstraction has 159 states and 197 transitions. [2022-02-21 04:15:26,646 INFO L587 BuchiCegarLoop]: Abstraction has 159 states and 197 transitions. [2022-02-21 04:15:26,646 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:15:26,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 197 transitions. [2022-02-21 04:15:26,646 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 112 [2022-02-21 04:15:26,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:26,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:26,647 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:26,647 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:26,647 INFO L791 eck$LassoCheckResult]: Stem: 2864#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 2850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1, main_~retValue_acc~8#1, main_~tmp~6#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~6#1;assume { :begin_inline_select_helpers } true; 2851#L680 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 2826#L673 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; 2827#L688 main_#t~ret43#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~6#1 := main_#t~ret43#1;havoc main_#t~ret43#1; 2810#L775 assume 0 != main_~tmp~6#1;assume { :begin_inline_setup } true; 2768#L752 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_#t~nondet41#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 2769#L600-2 [2022-02-21 04:15:26,649 INFO L793 eck$LassoCheckResult]: Loop: 2769#L600-2 assume !false; 2891#L601 assume test_~splverifierCounter~0#1 < 4; 2892#L602 test_~tmp~5#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; 2925#L610 assume !(0 != test_~tmp~5#1); 2923#L610-2 test_~tmp___0~1#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; 2921#L620 assume !(0 != test_~tmp___0~1#1); 2919#L620-2 test_~tmp___2~0#1 := test_#t~nondet40#1;havoc test_#t~nondet40#1; 2918#L630 assume 0 != test_~tmp___2~0#1; 2916#L636-2 assume { :begin_inline_timeShift } true; 2824#L442 assume !(0 != ~pumpRunning~0); 2825#L442-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret27#1, processEnvironment_~tmp~3#1;havoc processEnvironment_~tmp~3#1; 2840#L474 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret37#1, isHighWaterLevel_~retValue_acc~5#1, isHighWaterLevel_~tmp~4#1, isHighWaterLevel_~tmp___0~0#1;havoc isHighWaterLevel_~retValue_acc~5#1;havoc isHighWaterLevel_~tmp~4#1;havoc isHighWaterLevel_~tmp___0~0#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~11#1;havoc isHighWaterSensorDry_~retValue_acc~11#1; 2853#L899 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11#1 := 1;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; 2816#L904 isHighWaterLevel_#t~ret37#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~4#1 := isHighWaterLevel_#t~ret37#1;havoc isHighWaterLevel_#t~ret37#1; 2817#L576 assume 0 != isHighWaterLevel_~tmp~4#1;isHighWaterLevel_~tmp___0~0#1 := 0; 2856#L576-2 isHighWaterLevel_~retValue_acc~5#1 := isHighWaterLevel_~tmp___0~0#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~5#1; 2857#L582 processEnvironment_#t~ret27#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~3#1 := processEnvironment_#t~ret27#1;havoc processEnvironment_#t~ret27#1; 2879#L478 assume !(0 != processEnvironment_~tmp~3#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 2875#L466 assume { :end_inline_processEnvironment__wrappee__base } true; 2876#L474-1 assume { :end_inline_processEnvironment } true; 2899#L449-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret44#1, __utac_acc__Specification1_spec__1_#t~ret45#1, __utac_acc__Specification1_spec__1_~tmp~7#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~7#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;havoc isMethaneLevelCritical_~retValue_acc~9#1;isMethaneLevelCritical_~retValue_acc~9#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~9#1; 2898#L859 __utac_acc__Specification1_spec__1_#t~ret44#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~7#1 := __utac_acc__Specification1_spec__1_#t~ret44#1;havoc __utac_acc__Specification1_spec__1_#t~ret44#1; 2896#L797 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~7#1); 2894#L797-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 2893#L459 assume { :end_inline_timeShift } true; 2769#L600-2 [2022-02-21 04:15:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 5 times [2022-02-21 04:15:26,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:26,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028984174] [2022-02-21 04:15:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,678 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1161661781, now seen corresponding path program 1 times [2022-02-21 04:15:26,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:26,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782956802] [2022-02-21 04:15:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,688 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1882300775, now seen corresponding path program 1 times [2022-02-21 04:15:26,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:26,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043080134] [2022-02-21 04:15:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:26,706 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:29,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:15:29 BoogieIcfgContainer [2022-02-21 04:15:29,270 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:15:29,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:15:29,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:15:29,271 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:15:29,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:15:24" (3/4) ... [2022-02-21 04:15:29,273 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 04:15:29,325 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 04:15:29,326 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:15:29,327 INFO L158 Benchmark]: Toolchain (without parser) took 5899.57ms. Allocated memory was 81.8MB in the beginning and 148.9MB in the end (delta: 67.1MB). Free memory was 44.0MB in the beginning and 101.2MB in the end (delta: -57.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,327 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:15:29,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.57ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 64.6MB in the end (delta: -20.7MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.85ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 61.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,328 INFO L158 Benchmark]: Boogie Preprocessor took 28.65ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,328 INFO L158 Benchmark]: RCFGBuilder took 404.92ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 39.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,329 INFO L158 Benchmark]: BuchiAutomizer took 4950.01ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 39.0MB in the beginning and 103.3MB in the end (delta: -64.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,329 INFO L158 Benchmark]: Witness Printer took 54.85ms. Allocated memory is still 148.9MB. Free memory was 103.3MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:29,333 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.11ms. Allocated memory is still 81.8MB. Free memory was 61.2MB in the beginning and 61.1MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.57ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 64.6MB in the end (delta: -20.7MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.85ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 61.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.65ms. Allocated memory is still 100.7MB. Free memory was 61.3MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 404.92ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 39.0MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 4950.01ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 39.0MB in the beginning and 103.3MB in the end (delta: -64.3MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 54.85ms. Allocated memory is still 148.9MB. Free memory was 103.3MB in the beginning and 101.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 159 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 384 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 159 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1095 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1095 mSDsluCounter, 1443 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 775 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 668 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 600]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {splverifierCounter=0, retValue_acc=0, tmp___0=0, NULL=0, head=0, tmp___0=0, pumpRunning=0, NULL=1, tmp___0=0, methaneLevelCritical=0, \result=0, retValue_acc=1, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7865dd8a=0, \result=1, retValue_acc=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ec5aeb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3513f0d9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@40ce94f=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e7610a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3636c623=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@443c77bf=29, tmp___2=29, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d07a606=0, tmp=1, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63eba354=0, \result=0, tmp=0, head=0, retValue_acc=0, tmp___1=0, NULL=0, waterLevel=1, systemActive=1, tmp=0, tmp=0, \result=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 600]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L434] int pumpRunning = 0; [L435] int systemActive = 1; [L693] int cleanupTimeShifts = 4; [L816] int waterLevel = 1; [L817] int methaneLevelCritical = 0; [L766] int retValue_acc ; [L767] int tmp ; [L771] FCALL select_helpers() [L772] FCALL select_features() [L773] CALL, EXPR valid_product() [L684] int retValue_acc ; [L687] retValue_acc = 1 [L688] return (retValue_acc); [L773] RET, EXPR valid_product() [L773] tmp = valid_product() [L775] COND TRUE \read(tmp) [L777] FCALL setup() [L778] CALL runTest() [L760] CALL test() [L591] int splverifierCounter ; [L592] int tmp ; [L593] int tmp___0 ; [L594] int tmp___1 ; [L595] int tmp___2 ; [L598] splverifierCounter = 0 Loop: [L600] COND TRUE 1 [L602] COND TRUE splverifierCounter < 4 [L608] tmp = __VERIFIER_nondet_int() [L610] COND FALSE !(\read(tmp)) [L618] tmp___0 = __VERIFIER_nondet_int() [L620] COND FALSE !(\read(tmp___0)) [L628] tmp___2 = __VERIFIER_nondet_int() [L630] COND TRUE \read(tmp___2) [L643] CALL timeShift() [L442] COND FALSE !(\read(pumpRunning)) [L449] COND TRUE \read(systemActive) [L451] CALL processEnvironment() [L471] int tmp ; [L474] COND TRUE ! pumpRunning [L476] CALL, EXPR isHighWaterLevel() [L568] int retValue_acc ; [L569] int tmp ; [L570] int tmp___0 ; [L574] CALL, EXPR isHighWaterSensorDry() [L896] int retValue_acc ; [L899] COND TRUE waterLevel < 2 [L900] retValue_acc = 1 [L901] return (retValue_acc); [L574] RET, EXPR isHighWaterSensorDry() [L574] tmp = isHighWaterSensorDry() [L576] COND TRUE \read(tmp) [L577] tmp___0 = 0 [L581] retValue_acc = tmp___0 [L582] return (retValue_acc); [L476] RET, EXPR isHighWaterLevel() [L476] tmp = isHighWaterLevel() [L478] COND FALSE !(\read(tmp)) [L484] FCALL processEnvironment__wrappee__base() [L451] RET processEnvironment() [L457] CALL __utac_acc__Specification1_spec__1() [L790] int tmp ; [L791] int tmp___0 ; [L795] CALL, EXPR isMethaneLevelCritical() [L855] int retValue_acc ; [L858] retValue_acc = methaneLevelCritical [L859] return (retValue_acc); [L795] RET, EXPR isMethaneLevelCritical() [L795] tmp = isMethaneLevelCritical() [L797] COND FALSE !(\read(tmp)) [L457] RET __utac_acc__Specification1_spec__1() [L643] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 04:15:29,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)