./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product41.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_product41.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 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:15:25,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:15:25,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:15:25,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:15:25,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:15:25,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:15:25,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:15:25,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:15:25,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:15:25,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:15:25,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:15:25,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:15:25,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:15:25,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:15:25,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:15:25,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:15:25,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:15:25,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:15:25,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:15:25,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:15:25,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:15:25,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:15:25,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:15:25,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:15:25,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:15:25,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:15:25,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:15:25,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:15:25,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:15:25,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:15:25,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:15:25,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:15:25,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:15:25,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:15:25,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:15:25,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:15:25,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:15:25,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:15:25,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:15:25,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:15:25,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:15:25,826 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:25,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:15:25,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:15:25,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:15:25,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:15:25,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:15:25,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:15:25,855 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:15:25,856 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:15:25,856 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:15:25,856 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:15:25,857 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:15:25,857 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:15:25,857 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:15:25,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:15:25,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:15:25,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:15:25,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:15:25,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:15:25,859 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:15:25,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:15:25,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:15:25,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:15:25,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:15:25,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:15:25,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:15:25,861 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:15:25,861 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 -> 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c [2022-02-21 04:15:26,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:15:26,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:15:26,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:15:26,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:15:26,071 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:15:26,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2022-02-21 04:15:26,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ad313ea/06ffb2556e88478797a0ef673c2c90dc/FLAG56e8974f9 [2022-02-21 04:15:26,603 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:15:26,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2022-02-21 04:15:26,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ad313ea/06ffb2556e88478797a0ef673c2c90dc/FLAG56e8974f9 [2022-02-21 04:15:26,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ad313ea/06ffb2556e88478797a0ef673c2c90dc [2022-02-21 04:15:26,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:15:26,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:15:26,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:15:26,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:15:26,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:15:26,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:15:26" (1/1) ... [2022-02-21 04:15:26,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3761f87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:26, skipping insertion in model container [2022-02-21 04:15:26,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:15:26" (1/1) ... [2022-02-21 04:15:26,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:15:27,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:15:27,218 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_product41.cil.c[17493,17506] [2022-02-21 04:15:27,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:15:27,226 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:15:27,283 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_product41.cil.c[17493,17506] [2022-02-21 04:15:27,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:15:27,298 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:15:27,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:27 WrapperNode [2022-02-21 04:15:27,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:15:27,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:15:27,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:15:27,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:15:27,306 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:27" (1/1) ... [2022-02-21 04:15:27,326 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:27" (1/1) ... [2022-02-21 04:15:27,361 INFO L137 Inliner]: procedures = 53, calls = 151, calls flagged for inlining = 48, calls inlined = 56, statements flattened = 452 [2022-02-21 04:15:27,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:15:27,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:15:27,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:15:27,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:15:27,371 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:27" (1/1) ... [2022-02-21 04:15:27,372 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:27" (1/1) ... [2022-02-21 04:15:27,382 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:27" (1/1) ... [2022-02-21 04:15:27,383 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:27" (1/1) ... [2022-02-21 04:15:27,390 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:27" (1/1) ... [2022-02-21 04:15:27,403 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:27" (1/1) ... [2022-02-21 04:15:27,412 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:27" (1/1) ... [2022-02-21 04:15:27,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:15:27,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:15:27,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:15:27,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:15:27,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:27" (1/1) ... [2022-02-21 04:15:27,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:15:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:15:27,449 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:27,451 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:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:15:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:15:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:15:27,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:15:27,566 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:15:27,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:15:27,969 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:15:27,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:15:27,978 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:15:27,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:15:27 BoogieIcfgContainer [2022-02-21 04:15:27,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:15:27,981 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:15:27,981 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:15:27,983 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:15:27,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:15:27,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:15:26" (1/3) ... [2022-02-21 04:15:27,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63775297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:15:27, skipping insertion in model container [2022-02-21 04:15:27,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:15:27,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:15:27" (2/3) ... [2022-02-21 04:15:27,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63775297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:15:27, skipping insertion in model container [2022-02-21 04:15:27,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:15:27,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:15:27" (3/3) ... [2022-02-21 04:15:27,987 INFO L388 chiAutomizerObserver]: Analyzing ICFG minepump_spec1_product41.cil.c [2022-02-21 04:15:28,029 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:15:28,029 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:15:28,029 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:15:28,029 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:15:28,030 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:15:28,030 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:15:28,030 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:15:28,030 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:15:28,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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:28,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2022-02-21 04:15:28,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:28,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:28,095 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:28,095 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:28,095 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:15:28,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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:28,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2022-02-21 04:15:28,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:28,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:28,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:28,111 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:28,115 INFO L791 eck$LassoCheckResult]: Stem: 105#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 35#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret48#1, main_~retValue_acc~9#1, main_~tmp~7#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~7#1;assume { :begin_inline_select_helpers } true; 29#L880true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 39#L873true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~11#1;havoc valid_product_~retValue_acc~11#1;valid_product_~retValue_acc~11#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~11#1; 20#L888true main_#t~ret48#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~7#1 := main_#t~ret48#1;havoc main_#t~ret48#1; 66#L844true assume 0 != main_~tmp~7#1;assume { :begin_inline_setup } true; 72#L818true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet27#1, test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 48#L430-2true [2022-02-21 04:15:28,115 INFO L793 eck$LassoCheckResult]: Loop: 48#L430-2true assume !false; 116#L431true assume test_~splverifierCounter~0#1 < 4; 77#L432true test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; 93#L440true assume !(0 != test_~tmp~3#1); 90#L440-2true test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; 87#L450true assume !(0 != test_~tmp___0~0#1); 19#L450-2true test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 58#L460true assume 0 != test_~tmp___2~0#1; 71#L466-2true assume { :begin_inline_timeShift } true; 44#L596true assume !(0 != ~pumpRunning~0); 103#L596-2true assume !(0 != ~systemActive~0); 89#L603-1true assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; 85#L533-1true __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; 15#L910true assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); 13#L910-1true assume { :end_inline___utac_acc__Specification1_spec__1 } true; 33#L613true assume { :end_inline_timeShift } true; 48#L430-2true [2022-02-21 04:15:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 1 times [2022-02-21 04:15:28,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:28,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505945707] [2022-02-21 04:15:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:28,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:28,279 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash -325967420, now seen corresponding path program 1 times [2022-02-21 04:15:28,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:28,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286510171] [2022-02-21 04:15:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:28,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:28,293 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1029451656, now seen corresponding path program 1 times [2022-02-21 04:15:28,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:28,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724450630] [2022-02-21 04:15:28,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:28,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; {127#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:15:28,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret48#1, main_~retValue_acc~9#1, main_~tmp~7#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~7#1;assume { :begin_inline_select_helpers } true; {127#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:15:28,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {127#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:15:28,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {127#(= 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~11#1;havoc valid_product_~retValue_acc~11#1;valid_product_~retValue_acc~11#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~11#1; {128#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-21 04:15:28,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret48#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~7#1 := main_#t~ret48#1;havoc main_#t~ret48#1; {129#(= |ULTIMATE.start_main_~tmp~7#1| ~systemActive~0)} is VALID [2022-02-21 04:15:28,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#(= |ULTIMATE.start_main_~tmp~7#1| ~systemActive~0)} assume 0 != main_~tmp~7#1;assume { :begin_inline_setup } true; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet27#1, test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#(not (= 0 ~systemActive~0))} assume !false; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#(not (= 0 ~systemActive~0))} test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~3#1); {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#(not (= 0 ~systemActive~0))} test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~0#1); {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#(not (= 0 ~systemActive~0))} test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#(not (= 0 ~systemActive~0))} assume 0 != test_~tmp___2~0#1; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#(not (= 0 ~systemActive~0))} assume { :begin_inline_timeShift } true; {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {130#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:15:28,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {130#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {126#false} is VALID [2022-02-21 04:15:28,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {126#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; {126#false} is VALID [2022-02-21 04:15:28,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {126#false} __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; {126#false} is VALID [2022-02-21 04:15:28,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {126#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); {126#false} is VALID [2022-02-21 04:15:28,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {126#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {126#false} is VALID [2022-02-21 04:15:28,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {126#false} assume { :end_inline_timeShift } true; {126#false} is VALID [2022-02-21 04:15:28,450 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:28,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:28,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724450630] [2022-02-21 04:15:28,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724450630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:28,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:28,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:15:28,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573057253] [2022-02-21 04:15:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:28,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:28,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:15:28,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:15:28,620 INFO L87 Difference]: Start difference. First operand has 117 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:28,930 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2022-02-21 04:15:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:15:28,931 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:28,949 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:28,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 145 transitions. [2022-02-21 04:15:28,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2022-02-21 04:15:28,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 104 states and 135 transitions. [2022-02-21 04:15:28,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2022-02-21 04:15:28,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2022-02-21 04:15:28,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 135 transitions. [2022-02-21 04:15:28,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:28,984 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-02-21 04:15:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 135 transitions. [2022-02-21 04:15:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-21 04:15:29,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:29,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 135 transitions. Second operand has 104 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 103 states have internal predecessors, (135), 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:29,005 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 135 transitions. Second operand has 104 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 103 states have internal predecessors, (135), 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:29,006 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 104 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 103 states have internal predecessors, (135), 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:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,009 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-02-21 04:15:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-02-21 04:15:29,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:29,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:29,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 103 states have internal predecessors, (135), 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 104 states and 135 transitions. [2022-02-21 04:15:29,011 INFO L87 Difference]: Start difference. First operand has 104 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 103 states have internal predecessors, (135), 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 104 states and 135 transitions. [2022-02-21 04:15:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,013 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2022-02-21 04:15:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2022-02-21 04:15:29,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:29,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:29,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:29,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 103 states have internal predecessors, (135), 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:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2022-02-21 04:15:29,018 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-02-21 04:15:29,018 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2022-02-21 04:15:29,018 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:15:29,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2022-02-21 04:15:29,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 70 [2022-02-21 04:15:29,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:29,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:29,024 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:29,024 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:29,024 INFO L791 eck$LassoCheckResult]: Stem: 351#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret48#1, main_~retValue_acc~9#1, main_~tmp~7#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~7#1;assume { :begin_inline_select_helpers } true; 293#L880 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 294#L873 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~11#1;havoc valid_product_~retValue_acc~11#1;valid_product_~retValue_acc~11#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~11#1; 279#L888 main_#t~ret48#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~7#1 := main_#t~ret48#1;havoc main_#t~ret48#1; 280#L844 assume 0 != main_~tmp~7#1;assume { :begin_inline_setup } true; 330#L818 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet27#1, test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 298#L430-2 [2022-02-21 04:15:29,024 INFO L793 eck$LassoCheckResult]: Loop: 298#L430-2 assume !false; 317#L431 assume test_~splverifierCounter~0#1 < 4; 339#L432 test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; 340#L440 assume !(0 != test_~tmp~3#1); 334#L440-2 test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; 344#L450 assume !(0 != test_~tmp___0~0#1); 277#L450-2 test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 278#L460 assume 0 != test_~tmp___2~0#1; 324#L466-2 assume { :begin_inline_timeShift } true; 308#L596 assume !(0 != ~pumpRunning~0); 309#L596-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret36#1, processEnvironment_~tmp~4#1;havoc processEnvironment_~tmp~4#1; 314#L628 assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; 315#L620-1 assume { :end_inline_processEnvironment__wrappee__base } true; 300#L628-1 assume { :end_inline_processEnvironment } true; 341#L603-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; 343#L533-1 __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; 269#L910 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); 266#L910-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 267#L613 assume { :end_inline_timeShift } true; 298#L430-2 [2022-02-21 04:15:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 2 times [2022-02-21 04:15:29,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105154766] [2022-02-21 04:15:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,036 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,046 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1621750243, now seen corresponding path program 1 times [2022-02-21 04:15:29,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337084665] [2022-02-21 04:15:29,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:29,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {566#true} assume !false; {566#true} is VALID [2022-02-21 04:15:29,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {566#true} assume test_~splverifierCounter~0#1 < 4; {566#true} is VALID [2022-02-21 04:15:29,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#true} test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; {566#true} is VALID [2022-02-21 04:15:29,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {566#true} assume !(0 != test_~tmp~3#1); {566#true} is VALID [2022-02-21 04:15:29,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {566#true} test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {566#true} is VALID [2022-02-21 04:15:29,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#true} assume !(0 != test_~tmp___0~0#1); {566#true} is VALID [2022-02-21 04:15:29,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#true} test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {566#true} is VALID [2022-02-21 04:15:29,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {566#true} assume 0 != test_~tmp___2~0#1; {566#true} is VALID [2022-02-21 04:15:29,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {566#true} assume { :begin_inline_timeShift } true; {566#true} is VALID [2022-02-21 04:15:29,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {566#true} assume !(0 != ~pumpRunning~0); {568#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#(= ~pumpRunning~0 0)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret36#1, processEnvironment_~tmp~4#1;havoc processEnvironment_~tmp~4#1; {568#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#(= ~pumpRunning~0 0)} assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; {567#false} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {567#false} assume { :end_inline_processEnvironment__wrappee__base } true; {567#false} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#false} assume { :end_inline_processEnvironment } true; {567#false} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; {567#false} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#false} __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; {567#false} is VALID [2022-02-21 04:15:29,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); {567#false} is VALID [2022-02-21 04:15:29,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {567#false} is VALID [2022-02-21 04:15:29,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {567#false} assume { :end_inline_timeShift } true; {567#false} is VALID [2022-02-21 04:15:29,066 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:29,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:29,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337084665] [2022-02-21 04:15:29,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337084665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:29,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:29,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:15:29,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816383162] [2022-02-21 04:15:29,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:29,067 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:15:29,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:29,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:15:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:15:29,068 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 33 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:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,208 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2022-02-21 04:15:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:15:29,209 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:29,224 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:29,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 200 transitions. [2022-02-21 04:15:29,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 112 [2022-02-21 04:15:29,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 200 transitions. [2022-02-21 04:15:29,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2022-02-21 04:15:29,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2022-02-21 04:15:29,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 200 transitions. [2022-02-21 04:15:29,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:29,238 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 200 transitions. [2022-02-21 04:15:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 200 transitions. [2022-02-21 04:15:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-02-21 04:15:29,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:29,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states and 200 transitions. Second operand has 159 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 158 states have internal predecessors, (200), 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:29,255 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states and 200 transitions. Second operand has 159 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 158 states have internal predecessors, (200), 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:29,255 INFO L87 Difference]: Start difference. First operand 159 states and 200 transitions. Second operand has 159 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 158 states have internal predecessors, (200), 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:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,258 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2022-02-21 04:15:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2022-02-21 04:15:29,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:29,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:29,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 158 states have internal predecessors, (200), 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 159 states and 200 transitions. [2022-02-21 04:15:29,260 INFO L87 Difference]: Start difference. First operand has 159 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 158 states have internal predecessors, (200), 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 159 states and 200 transitions. [2022-02-21 04:15:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,264 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2022-02-21 04:15:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2022-02-21 04:15:29,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:29,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:29,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:29,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.2578616352201257) internal successors, (200), 158 states have internal predecessors, (200), 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:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 200 transitions. [2022-02-21 04:15:29,273 INFO L704 BuchiCegarLoop]: Abstraction has 159 states and 200 transitions. [2022-02-21 04:15:29,273 INFO L587 BuchiCegarLoop]: Abstraction has 159 states and 200 transitions. [2022-02-21 04:15:29,273 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:15:29,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 200 transitions. [2022-02-21 04:15:29,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 112 [2022-02-21 04:15:29,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:29,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:29,278 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:29,278 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:29,278 INFO L791 eck$LassoCheckResult]: Stem: 840#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 778#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret48#1, main_~retValue_acc~9#1, main_~tmp~7#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~7#1;assume { :begin_inline_select_helpers } true; 770#L880 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 771#L873 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~11#1;havoc valid_product_~retValue_acc~11#1;valid_product_~retValue_acc~11#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~11#1; 756#L888 main_#t~ret48#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~7#1 := main_#t~ret48#1;havoc main_#t~ret48#1; 757#L844 assume 0 != main_~tmp~7#1;assume { :begin_inline_setup } true; 811#L818 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet27#1, test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 816#L430-2 [2022-02-21 04:15:29,279 INFO L793 eck$LassoCheckResult]: Loop: 816#L430-2 assume !false; 864#L431 assume test_~splverifierCounter~0#1 < 4; 823#L432 test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; 824#L440 assume !(0 != test_~tmp~3#1); 817#L440-2 test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; 830#L450 assume !(0 != test_~tmp___0~0#1); 754#L450-2 test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 755#L460 assume 0 != test_~tmp___2~0#1; 803#L466-2 assume { :begin_inline_timeShift } true; 786#L596 assume !(0 != ~pumpRunning~0); 787#L596-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret36#1, processEnvironment_~tmp~4#1;havoc processEnvironment_~tmp~4#1; 791#L628 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret47#1, isHighWaterLevel_~retValue_acc~8#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~8#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~5#1;havoc isHighWaterSensorDry_~retValue_acc~5#1; 792#L573 assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~5#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; 788#L578 isHighWaterLevel_#t~ret47#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret47#1;havoc isHighWaterLevel_#t~ret47#1; 774#L748 assume 0 != isHighWaterLevel_~tmp~6#1;isHighWaterLevel_~tmp___0~1#1 := 0; 730#L748-2 isHighWaterLevel_~retValue_acc~8#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; 731#L754 processEnvironment_#t~ret36#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~4#1 := processEnvironment_#t~ret36#1;havoc processEnvironment_#t~ret36#1; 732#L632 assume !(0 != processEnvironment_~tmp~4#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 763#L620 assume { :end_inline_processEnvironment__wrappee__base } true; 794#L628-1 assume { :end_inline_processEnvironment } true; 872#L603-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; 871#L533-1 __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; 868#L910 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); 867#L910-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 865#L613 assume { :end_inline_timeShift } true; 816#L430-2 [2022-02-21 04:15:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 3 times [2022-02-21 04:15:29,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791163804] [2022-02-21 04:15:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,313 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash 105530797, now seen corresponding path program 1 times [2022-02-21 04:15:29,313 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010113729] [2022-02-21 04:15:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:15:29,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {1210#true} assume !false; {1210#true} is VALID [2022-02-21 04:15:29,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#true} assume test_~splverifierCounter~0#1 < 4; {1210#true} is VALID [2022-02-21 04:15:29,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#true} test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; {1210#true} is VALID [2022-02-21 04:15:29,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {1210#true} assume !(0 != test_~tmp~3#1); {1210#true} is VALID [2022-02-21 04:15:29,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {1210#true} test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; {1210#true} is VALID [2022-02-21 04:15:29,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#true} assume !(0 != test_~tmp___0~0#1); {1210#true} is VALID [2022-02-21 04:15:29,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {1210#true} test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; {1210#true} is VALID [2022-02-21 04:15:29,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#true} assume 0 != test_~tmp___2~0#1; {1210#true} is VALID [2022-02-21 04:15:29,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#true} assume { :begin_inline_timeShift } true; {1210#true} is VALID [2022-02-21 04:15:29,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {1210#true} assume !(0 != ~pumpRunning~0); {1210#true} is VALID [2022-02-21 04:15:29,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {1210#true} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret36#1, processEnvironment_~tmp~4#1;havoc processEnvironment_~tmp~4#1; {1210#true} is VALID [2022-02-21 04:15:29,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {1210#true} assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret47#1, isHighWaterLevel_~retValue_acc~8#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~8#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~5#1;havoc isHighWaterSensorDry_~retValue_acc~5#1; {1210#true} is VALID [2022-02-21 04:15:29,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {1210#true} assume !(~waterLevel~0 < 2);isHighWaterSensorDry_~retValue_acc~5#1 := 0;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; {1212#(= |ULTIMATE.start_isHighWaterSensorDry_#res#1| 0)} is VALID [2022-02-21 04:15:29,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {1212#(= |ULTIMATE.start_isHighWaterSensorDry_#res#1| 0)} isHighWaterLevel_#t~ret47#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret47#1;havoc isHighWaterLevel_#t~ret47#1; {1213#(= |ULTIMATE.start_isHighWaterLevel_~tmp~6#1| 0)} is VALID [2022-02-21 04:15:29,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {1213#(= |ULTIMATE.start_isHighWaterLevel_~tmp~6#1| 0)} assume 0 != isHighWaterLevel_~tmp~6#1;isHighWaterLevel_~tmp___0~1#1 := 0; {1211#false} is VALID [2022-02-21 04:15:29,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#false} isHighWaterLevel_~retValue_acc~8#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; {1211#false} is VALID [2022-02-21 04:15:29,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#false} processEnvironment_#t~ret36#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~4#1 := processEnvironment_#t~ret36#1;havoc processEnvironment_#t~ret36#1; {1211#false} is VALID [2022-02-21 04:15:29,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#false} assume !(0 != processEnvironment_~tmp~4#1);assume { :begin_inline_processEnvironment__wrappee__base } true; {1211#false} is VALID [2022-02-21 04:15:29,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {1211#false} assume { :end_inline_processEnvironment__wrappee__base } true; {1211#false} is VALID [2022-02-21 04:15:29,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {1211#false} assume { :end_inline_processEnvironment } true; {1211#false} is VALID [2022-02-21 04:15:29,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#false} assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; {1211#false} is VALID [2022-02-21 04:15:29,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {1211#false} __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; {1211#false} is VALID [2022-02-21 04:15:29,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {1211#false} assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); {1211#false} is VALID [2022-02-21 04:15:29,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {1211#false} assume { :end_inline___utac_acc__Specification1_spec__1 } true; {1211#false} is VALID [2022-02-21 04:15:29,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {1211#false} assume { :end_inline_timeShift } true; {1211#false} is VALID [2022-02-21 04:15:29,363 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:29,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:15:29,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010113729] [2022-02-21 04:15:29,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010113729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:15:29,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:15:29,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:15:29,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791599798] [2022-02-21 04:15:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:15:29,364 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:15:29,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:15:29,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:15:29,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:15:29,365 INFO L87 Difference]: Start difference. First operand 159 states and 200 transitions. cyclomatic complexity: 43 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:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,673 INFO L93 Difference]: Finished difference Result 451 states and 562 transitions. [2022-02-21 04:15:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:15:29,674 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:29,687 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:29,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 562 transitions. [2022-02-21 04:15:29,701 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 328 [2022-02-21 04:15:29,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 451 states and 562 transitions. [2022-02-21 04:15:29,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 451 [2022-02-21 04:15:29,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 451 [2022-02-21 04:15:29,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 451 states and 562 transitions. [2022-02-21 04:15:29,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:15:29,712 INFO L681 BuchiCegarLoop]: Abstraction has 451 states and 562 transitions. [2022-02-21 04:15:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 562 transitions. [2022-02-21 04:15:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 165. [2022-02-21 04:15:29,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:15:29,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states and 562 transitions. Second operand has 165 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 164 states have internal predecessors, (206), 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:29,716 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states and 562 transitions. Second operand has 165 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 164 states have internal predecessors, (206), 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:29,717 INFO L87 Difference]: Start difference. First operand 451 states and 562 transitions. Second operand has 165 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 164 states have internal predecessors, (206), 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:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,726 INFO L93 Difference]: Finished difference Result 451 states and 562 transitions. [2022-02-21 04:15:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 562 transitions. [2022-02-21 04:15:29,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:29,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:29,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 164 states have internal predecessors, (206), 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 451 states and 562 transitions. [2022-02-21 04:15:29,727 INFO L87 Difference]: Start difference. First operand has 165 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 164 states have internal predecessors, (206), 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 451 states and 562 transitions. [2022-02-21 04:15:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:15:29,736 INFO L93 Difference]: Finished difference Result 451 states and 562 transitions. [2022-02-21 04:15:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 562 transitions. [2022-02-21 04:15:29,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:15:29,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:15:29,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:15:29,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:15:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 1.2484848484848485) internal successors, (206), 164 states have internal predecessors, (206), 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:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 206 transitions. [2022-02-21 04:15:29,740 INFO L704 BuchiCegarLoop]: Abstraction has 165 states and 206 transitions. [2022-02-21 04:15:29,740 INFO L587 BuchiCegarLoop]: Abstraction has 165 states and 206 transitions. [2022-02-21 04:15:29,740 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:15:29,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 206 transitions. [2022-02-21 04:15:29,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 116 [2022-02-21 04:15:29,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:15:29,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:15:29,741 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:15:29,742 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:29,742 INFO L791 eck$LassoCheckResult]: Stem: 1786#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(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4; 1719#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret48#1, main_~retValue_acc~9#1, main_~tmp~7#1;havoc main_~retValue_acc~9#1;havoc main_~tmp~7#1;assume { :begin_inline_select_helpers } true; 1710#L880 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 1711#L873 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~11#1;havoc valid_product_~retValue_acc~11#1;valid_product_~retValue_acc~11#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~11#1; 1696#L888 main_#t~ret48#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~7#1 := main_#t~ret48#1;havoc main_#t~ret48#1; 1697#L844 assume 0 != main_~tmp~7#1;assume { :begin_inline_setup } true; 1754#L818 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet27#1, test_#t~nondet28#1, test_#t~nondet29#1, test_#t~nondet30#1, test_~splverifierCounter~0#1, test_~tmp~3#1, test_~tmp___0~0#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~3#1;havoc test_~tmp___0~0#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 1718#L430-2 [2022-02-21 04:15:29,742 INFO L793 eck$LassoCheckResult]: Loop: 1718#L430-2 assume !false; 1735#L431 assume test_~splverifierCounter~0#1 < 4; 1791#L432 test_~tmp~3#1 := test_#t~nondet27#1;havoc test_#t~nondet27#1; 1831#L440 assume !(0 != test_~tmp~3#1); 1829#L440-2 test_~tmp___0~0#1 := test_#t~nondet28#1;havoc test_#t~nondet28#1; 1771#L450 assume !(0 != test_~tmp___0~0#1); 1694#L450-2 test_~tmp___2~0#1 := test_#t~nondet29#1;havoc test_#t~nondet29#1; 1695#L460 assume 0 != test_~tmp___2~0#1; 1747#L466-2 assume { :begin_inline_timeShift } true; 1727#L596 assume !(0 != ~pumpRunning~0); 1728#L596-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret36#1, processEnvironment_~tmp~4#1;havoc processEnvironment_~tmp~4#1; 1733#L628 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret47#1, isHighWaterLevel_~retValue_acc~8#1, isHighWaterLevel_~tmp~6#1, isHighWaterLevel_~tmp___0~1#1;havoc isHighWaterLevel_~retValue_acc~8#1;havoc isHighWaterLevel_~tmp~6#1;havoc isHighWaterLevel_~tmp___0~1#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~5#1;havoc isHighWaterSensorDry_~retValue_acc~5#1; 1734#L573 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5#1 := 1;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; 1729#L578 isHighWaterLevel_#t~ret47#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~6#1 := isHighWaterLevel_#t~ret47#1;havoc isHighWaterLevel_#t~ret47#1; 1730#L748 assume 0 != isHighWaterLevel_~tmp~6#1;isHighWaterLevel_~tmp___0~1#1 := 0; 1670#L748-2 isHighWaterLevel_~retValue_acc~8#1 := isHighWaterLevel_~tmp___0~1#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; 1671#L754 processEnvironment_#t~ret36#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~4#1 := processEnvironment_#t~ret36#1;havoc processEnvironment_#t~ret36#1; 1672#L632 assume !(0 != processEnvironment_~tmp~4#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 1703#L620 assume { :end_inline_processEnvironment__wrappee__base } true; 1717#L628-1 assume { :end_inline_processEnvironment } true; 1767#L603-1 assume { :begin_inline___utac_acc__Specification1_spec__1 } true;havoc __utac_acc__Specification1_spec__1_#t~ret50#1, __utac_acc__Specification1_spec__1_#t~ret51#1, __utac_acc__Specification1_spec__1_~tmp~8#1, __utac_acc__Specification1_spec__1_~tmp___0~2#1;havoc __utac_acc__Specification1_spec__1_~tmp~8#1;havoc __utac_acc__Specification1_spec__1_~tmp___0~2#1;assume { :begin_inline_isMethaneLevelCritical } true;havoc isMethaneLevelCritical_#res#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;havoc isMethaneLevelCritical_~retValue_acc~3#1;isMethaneLevelCritical_~retValue_acc~3#1 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~3#1; 1770#L533-1 __utac_acc__Specification1_spec__1_#t~ret50#1 := isMethaneLevelCritical_#res#1;assume { :end_inline_isMethaneLevelCritical } true;__utac_acc__Specification1_spec__1_~tmp~8#1 := __utac_acc__Specification1_spec__1_#t~ret50#1;havoc __utac_acc__Specification1_spec__1_#t~ret50#1; 1686#L910 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~8#1); 1683#L910-1 assume { :end_inline___utac_acc__Specification1_spec__1 } true; 1684#L613 assume { :end_inline_timeShift } true; 1718#L430-2 [2022-02-21 04:15:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 4 times [2022-02-21 04:15:29,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189047072] [2022-02-21 04:15:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,757 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 692336811, now seen corresponding path program 1 times [2022-02-21 04:15:29,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745385735] [2022-02-21 04:15:29,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,768 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:15:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash -558667929, now seen corresponding path program 1 times [2022-02-21 04:15:29,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:15:29,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187201241] [2022-02-21 04:15:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:15:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:15:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:15:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:15:29,786 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:15:32,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:15:32 BoogieIcfgContainer [2022-02-21 04:15:32,282 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:15:32,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:15:32,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:15:32,282 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:15:32,283 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:27" (3/4) ... [2022-02-21 04:15:32,284 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 04:15:32,327 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 04:15:32,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:15:32,330 INFO L158 Benchmark]: Toolchain (without parser) took 5376.94ms. Allocated memory was 109.1MB in the beginning and 182.5MB in the end (delta: 73.4MB). Free memory was 79.5MB in the beginning and 74.1MB in the end (delta: 5.4MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,331 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:15:32,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.82ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 71.1MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.27ms. Allocated memory is still 109.1MB. Free memory was 71.1MB in the beginning and 67.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,331 INFO L158 Benchmark]: Boogie Preprocessor took 52.17ms. Allocated memory is still 109.1MB. Free memory was 67.7MB in the beginning and 65.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,332 INFO L158 Benchmark]: RCFGBuilder took 565.31ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 65.6MB in the beginning and 116.4MB in the end (delta: -50.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,332 INFO L158 Benchmark]: BuchiAutomizer took 4300.78ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 115.7MB in the beginning and 77.2MB in the end (delta: 38.6MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,332 INFO L158 Benchmark]: Witness Printer took 47.23ms. Allocated memory is still 182.5MB. Free memory was 77.2MB in the beginning and 74.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:15:32,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.17ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.82ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 71.1MB in the end (delta: 8.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.27ms. Allocated memory is still 109.1MB. Free memory was 71.1MB in the beginning and 67.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.17ms. Allocated memory is still 109.1MB. Free memory was 67.7MB in the beginning and 65.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 565.31ms. Allocated memory was 109.1MB in the beginning and 151.0MB in the end (delta: 41.9MB). Free memory was 65.6MB in the beginning and 116.4MB in the end (delta: -50.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 4300.78ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 115.7MB in the beginning and 77.2MB in the end (delta: 38.6MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. * Witness Printer took 47.23ms. Allocated memory is still 182.5MB. Free memory was 77.2MB in the beginning and 74.1MB in the end (delta: 3.0MB). 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 165 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 286 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 165 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 969 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 969 mSDsluCounter, 940 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 509 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 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: 430]: 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, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22607f08=0, NULL=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15568384=0, head=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d8957bf=0, tmp___0=0, NULL=1, tmp___0=0, methaneLevelCritical=0, retValue_acc=1, \result=0, retValue_acc=1, \result=1, \result=1, retValue_acc=0, retValue_acc=0, tmp=1, tmp=1, tmp___2=29, cleanupTimeShifts=4, tmp=0, \result=0, tmp=0, head=0, tmp___1=0, NULL=0, waterLevel=1, systemActive=1, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14749154=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73d448ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fd87b03=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cbd0742=0, \result=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e68b8dc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62e295e4=29} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 430]: 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; [L490] int waterLevel = 1; [L491] int methaneLevelCritical = 0; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L759] int cleanupTimeShifts = 4; [L835] int retValue_acc ; [L836] int tmp ; [L840] FCALL select_helpers() [L841] FCALL select_features() [L842] CALL, EXPR valid_product() [L884] int retValue_acc ; [L887] retValue_acc = 1 [L888] return (retValue_acc); [L842] RET, EXPR valid_product() [L842] tmp = valid_product() [L844] COND TRUE \read(tmp) [L846] FCALL setup() [L847] CALL runTest() [L826] CALL test() [L421] int splverifierCounter ; [L422] int tmp ; [L423] int tmp___0 ; [L424] int tmp___1 ; [L425] int tmp___2 ; [L428] splverifierCounter = 0 Loop: [L430] COND TRUE 1 [L432] COND TRUE splverifierCounter < 4 [L438] tmp = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp)) [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND FALSE !(\read(tmp___0)) [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) [L473] CALL timeShift() [L596] COND FALSE !(\read(pumpRunning)) [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; [L628] COND TRUE ! pumpRunning [L630] CALL, EXPR isHighWaterLevel() [L740] int retValue_acc ; [L741] int tmp ; [L742] int tmp___0 ; [L746] CALL, EXPR isHighWaterSensorDry() [L570] int retValue_acc ; [L573] COND TRUE waterLevel < 2 [L574] retValue_acc = 1 [L575] return (retValue_acc); [L746] RET, EXPR isHighWaterSensorDry() [L746] tmp = isHighWaterSensorDry() [L748] COND TRUE \read(tmp) [L749] tmp___0 = 0 [L753] retValue_acc = tmp___0 [L754] return (retValue_acc); [L630] RET, EXPR isHighWaterLevel() [L630] tmp = isHighWaterLevel() [L632] COND FALSE !(\read(tmp)) [L638] FCALL processEnvironment__wrappee__base() [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR isMethaneLevelCritical() [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); [L908] RET, EXPR isMethaneLevelCritical() [L908] tmp = isMethaneLevelCritical() [L910] COND FALSE !(\read(tmp)) [L611] RET __utac_acc__Specification1_spec__1() [L473] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 04:15:32,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)