./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product35.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 2a503d744e1f87de1c9c505a18eb69768c300bcf ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 20:24:26,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:24:26,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:24:26,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:24:26,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:24:26,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:24:26,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:24:26,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:24:26,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:24:26,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:24:26,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:24:26,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:24:26,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:24:26,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:24:26,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:24:26,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:24:26,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:24:26,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:24:26,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:24:26,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:24:26,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:24:26,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:24:26,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:24:26,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:24:26,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:24:26,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:24:26,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:24:26,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:24:26,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:24:26,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:24:26,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:24:26,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:24:26,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:24:26,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:24:26,734 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:24:26,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:24:26,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:24:26,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:24:26,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:24:26,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:24:26,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:24:26,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 20:24:26,767 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:24:26,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:24:26,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:24:26,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:24:26,769 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:24:26,769 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:24:26,769 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:24:26,770 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:24:26,770 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:24:26,770 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:24:26,770 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:24:26,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:24:26,771 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:24:26,771 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:24:26,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:24:26,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:24:26,780 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:24:26,781 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:24:26,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:24:26,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:24:26,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:24:26,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:24:26,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:24:26,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:24:26,782 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:24:26,782 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 -> 2a503d744e1f87de1c9c505a18eb69768c300bcf [2021-07-06 20:24:26,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:24:27,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:24:27,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:24:27,011 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:24:27,012 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:24:27,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c [2021-07-06 20:24:27,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024563fa6/7e49896f9a2343ae81ee2844ae2d7841/FLAG4bbcd4e5d [2021-07-06 20:24:27,380 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:24:27,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c [2021-07-06 20:24:27,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024563fa6/7e49896f9a2343ae81ee2844ae2d7841/FLAG4bbcd4e5d [2021-07-06 20:24:27,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/024563fa6/7e49896f9a2343ae81ee2844ae2d7841 [2021-07-06 20:24:27,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:24:27,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:24:27,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:24:27,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:24:27,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:24:27,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:27" (1/1) ... [2021-07-06 20:24:27,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf7a064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:27, skipping insertion in model container [2021-07-06 20:24:27,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:27" (1/1) ... [2021-07-06 20:24:27,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:24:27,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:24:27,951 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c[7938,7951] [2021-07-06 20:24:28,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:24:28,032 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:24:28,055 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product35.cil.c[7938,7951] [2021-07-06 20:24:28,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:24:28,106 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:24:28,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28 WrapperNode [2021-07-06 20:24:28,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:24:28,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:24:28,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:24:28,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:24:28,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:24:28,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:24:28,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:24:28,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:24:28,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:24:28,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:24:28,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:24:28,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:24:28,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (1/1) ... [2021-07-06 20:24:28,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:24:28,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:24:28,225 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) [2021-07-06 20:24:28,226 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 [2021-07-06 20:24:28,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:24:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:24:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:24:28,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:24:28,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:24:28,879 INFO L299 CfgBuilder]: Removed 106 assume(true) statements. [2021-07-06 20:24:28,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:28 BoogieIcfgContainer [2021-07-06 20:24:28,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:24:28,881 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:24:28,881 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:24:28,883 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:24:28,883 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:28,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:24:27" (1/3) ... [2021-07-06 20:24:28,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637a2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:28, skipping insertion in model container [2021-07-06 20:24:28,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:28,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:28" (2/3) ... [2021-07-06 20:24:28,884 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@637a2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:28, skipping insertion in model container [2021-07-06 20:24:28,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:28,884 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:28" (3/3) ... [2021-07-06 20:24:28,885 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product35.cil.c [2021-07-06 20:24:28,920 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:24:28,920 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:24:28,920 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:24:28,920 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:24:28,920 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:24:28,920 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:24:28,920 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:24:28,920 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:24:28,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 83 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 82 states have internal predecessors, (126), 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) [2021-07-06 20:24:28,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2021-07-06 20:24:28,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:28,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:28,955 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:28,955 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:28,955 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:24:28,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 83 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 82 states have internal predecessors, (126), 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) [2021-07-06 20:24:28,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2021-07-06 20:24:28,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:28,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:28,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:28,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:28,975 INFO L791 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 7#L-1true havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 13#L541true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 48#L549true main_#t~ret33 := valid_product_#res;main_~tmp~4 := main_#t~ret33;havoc main_#t~ret33; 70#L411true assume 0 != main_~tmp~4; 54#L385true havoc test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 15#L307-1true [2021-07-06 20:24:28,975 INFO L793 eck$LassoCheckResult]: Loop: 15#L307-1true assume !false; 4#L58true assume test_~splverifierCounter~0 < 4; 32#L59true test_~tmp~0 := test_#t~nondet7;havoc test_#t~nondet7; 71#L67true assume !(0 != test_~tmp~0); 67#L67-1true test_~tmp___0~0 := test_#t~nondet8;havoc test_#t~nondet8; 45#L77true assume !(0 != test_~tmp___0~0); 43#L77-1true test_~tmp___2~0 := test_#t~nondet9;havoc test_#t~nondet9; 19#L87true assume 0 != test_~tmp___2~0; 52#L93-1true assume !(0 != ~pumpRunning~0); 85#L130true assume !(0 != ~systemActive~0); 60#L137true havoc __utac_acc__Specification3_spec__1_#t~ret30, __utac_acc__Specification3_spec__1_#t~ret31, __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 8#L468true __utac_acc__Specification3_spec__1_#t~ret30 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret30;havoc __utac_acc__Specification3_spec__1_#t~ret30; 69#L301true assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 15#L307-1true [2021-07-06 20:24:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:24:28,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:28,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364162143] [2021-07-06 20:24:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:28,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,132 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,208 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,228 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1672941122, now seen corresponding path program 1 times [2021-07-06 20:24:29,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176013262] [2021-07-06 20:24:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,234 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,236 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash 41337816, now seen corresponding path program 1 times [2021-07-06 20:24:29,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041322538] [2021-07-06 20:24:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:29,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:24:29,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:24:29,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:29,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041322538] [2021-07-06 20:24:29,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041322538] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:29,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:29,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:24:29,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372827333] [2021-07-06 20:24:29,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-06 20:24:29,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:24:29,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:24:29,409 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 82 states have internal predecessors, (126), 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.1666666666666665) internal successors, (19), 5 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) [2021-07-06 20:24:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:29,607 INFO L93 Difference]: Finished difference Result 216 states and 303 transitions. [2021-07-06 20:24:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:24:29,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 303 transitions. [2021-07-06 20:24:29,615 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 137 [2021-07-06 20:24:29,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 195 states and 282 transitions. [2021-07-06 20:24:29,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2021-07-06 20:24:29,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2021-07-06 20:24:29,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 282 transitions. [2021-07-06 20:24:29,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:29,622 INFO L681 BuchiCegarLoop]: Abstraction has 195 states and 282 transitions. [2021-07-06 20:24:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 282 transitions. [2021-07-06 20:24:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 123. [2021-07-06 20:24:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 122 states have internal predecessors, (177), 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) [2021-07-06 20:24:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2021-07-06 20:24:29,648 INFO L704 BuchiCegarLoop]: Abstraction has 123 states and 177 transitions. [2021-07-06 20:24:29,648 INFO L587 BuchiCegarLoop]: Abstraction has 123 states and 177 transitions. [2021-07-06 20:24:29,648 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:24:29,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 177 transitions. [2021-07-06 20:24:29,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2021-07-06 20:24:29,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:29,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:29,650 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:29,650 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:29,650 INFO L791 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 324#L-1 havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 325#L541 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 335#L549 main_#t~ret33 := valid_product_#res;main_~tmp~4 := main_#t~ret33;havoc main_#t~ret33; 381#L411 assume 0 != main_~tmp~4; 386#L385 havoc test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 333#L307-1 [2021-07-06 20:24:29,650 INFO L793 eck$LassoCheckResult]: Loop: 333#L307-1 assume !false; 317#L58 assume test_~splverifierCounter~0 < 4; 318#L59 test_~tmp~0 := test_#t~nondet7;havoc test_#t~nondet7; 363#L67 assume !(0 != test_~tmp~0); 380#L67-1 test_~tmp___0~0 := test_#t~nondet8;havoc test_#t~nondet8; 377#L77 assume !(0 != test_~tmp___0~0); 375#L77-1 test_~tmp___2~0 := test_#t~nondet9;havoc test_#t~nondet9; 342#L87 assume 0 != test_~tmp___2~0; 343#L93-1 assume !(0 != ~pumpRunning~0); 359#L130 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret11, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 391#L162 assume !(0 == ~pumpRunning~0); 384#L137 havoc __utac_acc__Specification3_spec__1_#t~ret30, __utac_acc__Specification3_spec__1_#t~ret31, __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 326#L468 __utac_acc__Specification3_spec__1_#t~ret30 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret30;havoc __utac_acc__Specification3_spec__1_#t~ret30; 327#L301 assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 333#L307-1 [2021-07-06 20:24:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:24:29,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578981324] [2021-07-06 20:24:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,695 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,729 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,745 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -353177362, now seen corresponding path program 1 times [2021-07-06 20:24:29,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861160061] [2021-07-06 20:24:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:29,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:29,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:24:29,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:29,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861160061] [2021-07-06 20:24:29,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861160061] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:29,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:29,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:29,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588968844] [2021-07-06 20:24:29,760 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:24:29,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:29,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:24:29,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:24:29,761 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. cyclomatic complexity: 57 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-07-06 20:24:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:29,825 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2021-07-06 20:24:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:24:29,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 229 transitions. [2021-07-06 20:24:29,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2021-07-06 20:24:29,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 229 transitions. [2021-07-06 20:24:29,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2021-07-06 20:24:29,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2021-07-06 20:24:29,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 229 transitions. [2021-07-06 20:24:29,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:29,837 INFO L681 BuchiCegarLoop]: Abstraction has 168 states and 229 transitions. [2021-07-06 20:24:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 229 transitions. [2021-07-06 20:24:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-07-06 20:24:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 167 states have internal predecessors, (229), 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) [2021-07-06 20:24:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2021-07-06 20:24:29,846 INFO L704 BuchiCegarLoop]: Abstraction has 168 states and 229 transitions. [2021-07-06 20:24:29,846 INFO L587 BuchiCegarLoop]: Abstraction has 168 states and 229 transitions. [2021-07-06 20:24:29,846 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:24:29,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 229 transitions. [2021-07-06 20:24:29,847 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2021-07-06 20:24:29,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:29,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:29,847 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:29,847 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] [2021-07-06 20:24:29,847 INFO L791 eck$LassoCheckResult]: Stem: 674#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 623#L-1 havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 624#L541 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 635#L549 main_#t~ret33 := valid_product_#res;main_~tmp~4 := main_#t~ret33;havoc main_#t~ret33; 683#L411 assume 0 != main_~tmp~4; 691#L385 havoc test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 636#L307-1 [2021-07-06 20:24:29,848 INFO L793 eck$LassoCheckResult]: Loop: 636#L307-1 assume !false; 614#L58 assume test_~splverifierCounter~0 < 4; 615#L59 test_~tmp~0 := test_#t~nondet7;havoc test_#t~nondet7; 664#L67 assume !(0 != test_~tmp~0); 682#L67-1 test_~tmp___0~0 := test_#t~nondet8;havoc test_#t~nondet8; 698#L77 assume !(0 != test_~tmp___0~0); 763#L77-1 test_~tmp___2~0 := test_#t~nondet9;havoc test_#t~nondet9; 642#L87 assume 0 != test_~tmp___2~0; 643#L93-1 assume !(0 != ~pumpRunning~0); 689#L130 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret11, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 699#L162 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret29, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 645#L508 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 646#L513 isHighWaterLevel_#t~ret29 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret29;havoc isHighWaterLevel_#t~ret29; 666#L264 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~1 := 0; 665#L264-2 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 654#L270 processEnvironment_#t~ret11 := isHighWaterLevel_#res;processEnvironment_~tmp~1 := processEnvironment_#t~ret11;havoc processEnvironment_#t~ret11; 655#L166 assume !(0 != processEnvironment_~tmp~1); 688#L137 havoc __utac_acc__Specification3_spec__1_#t~ret30, __utac_acc__Specification3_spec__1_#t~ret31, __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 760#L468 __utac_acc__Specification3_spec__1_#t~ret30 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret30;havoc __utac_acc__Specification3_spec__1_#t~ret30; 758#L301 assume 0 != __utac_acc__Specification3_spec__1_~tmp~3; 636#L307-1 [2021-07-06 20:24:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:24:29,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412221961] [2021-07-06 20:24:29,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,884 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,905 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,912 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash -539551526, now seen corresponding path program 1 times [2021-07-06 20:24:29,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638813066] [2021-07-06 20:24:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,916 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:29,918 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:29,920 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:29,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:29,920 INFO L82 PathProgramCache]: Analyzing trace with hash -524839552, now seen corresponding path program 1 times [2021-07-06 20:24:29,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:29,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086602803] [2021-07-06 20:24:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:29,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:29,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:29,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:24:29,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:29,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086602803] [2021-07-06 20:24:29,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086602803] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:29,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:29,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:29,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723708205] [2021-07-06 20:24:30,105 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2021-07-06 20:24:30,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:30,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 20:24:30,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:30,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:24:30,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:24:30,166 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. cyclomatic complexity: 64 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2021-07-06 20:24:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:30,252 INFO L93 Difference]: Finished difference Result 548 states and 750 transitions. [2021-07-06 20:24:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:24:30,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 548 states and 750 transitions. [2021-07-06 20:24:30,255 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 414 [2021-07-06 20:24:30,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 548 states to 548 states and 750 transitions. [2021-07-06 20:24:30,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2021-07-06 20:24:30,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2021-07-06 20:24:30,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 548 states and 750 transitions. [2021-07-06 20:24:30,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:30,259 INFO L681 BuchiCegarLoop]: Abstraction has 548 states and 750 transitions. [2021-07-06 20:24:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states and 750 transitions. [2021-07-06 20:24:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 330. [2021-07-06 20:24:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 330 states have (on average 1.3333333333333333) internal successors, (440), 329 states have internal predecessors, (440), 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) [2021-07-06 20:24:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 440 transitions. [2021-07-06 20:24:30,280 INFO L704 BuchiCegarLoop]: Abstraction has 330 states and 440 transitions. [2021-07-06 20:24:30,280 INFO L587 BuchiCegarLoop]: Abstraction has 330 states and 440 transitions. [2021-07-06 20:24:30,280 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:24:30,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 440 transitions. [2021-07-06 20:24:30,281 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 240 [2021-07-06 20:24:30,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:30,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:30,282 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:30,282 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] [2021-07-06 20:24:30,282 INFO L791 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(13);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string37.base, #t~string37.offset, 1);call write~init~int(77, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(101, #t~string37.base, 2 + #t~string37.offset, 1);call write~init~int(116, #t~string37.base, 3 + #t~string37.offset, 1);call write~init~int(104, #t~string37.base, 4 + #t~string37.offset, 1);call write~init~int(58, #t~string37.base, 5 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 6 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string39.base, #t~string39.offset, 1);call write~init~int(82, #t~string39.base, 1 + #t~string39.offset, 1);call write~init~int(73, #t~string39.base, 2 + #t~string39.offset, 1);call write~init~int(84, #t~string39.base, 3 + #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 4 + #t~string39.offset, 1);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string41.base, #t~string41.offset, 1);call write~init~int(75, #t~string41.base, 1 + #t~string41.offset, 1);call write~init~int(0, #t~string41.base, 2 + #t~string41.offset, 1);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string43.base, #t~string43.offset, 1);call write~init~int(0, #t~string43.base, 1 + #t~string43.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(21);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(21);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(30);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(9);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(25);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(30);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(9);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 1355#L-1 havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 1356#L541 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1369#L549 main_#t~ret33 := valid_product_#res;main_~tmp~4 := main_#t~ret33;havoc main_#t~ret33; 1417#L411 assume 0 != main_~tmp~4; 1426#L385 havoc test_#t~nondet7, test_#t~nondet8, test_#t~nondet9, test_#t~nondet10, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1427#L307-1 [2021-07-06 20:24:30,282 INFO L793 eck$LassoCheckResult]: Loop: 1427#L307-1 assume !false; 1595#L58 assume test_~splverifierCounter~0 < 4; 1596#L59 test_~tmp~0 := test_#t~nondet7;havoc test_#t~nondet7; 1664#L67 assume !(0 != test_~tmp~0); 1662#L67-1 test_~tmp___0~0 := test_#t~nondet8;havoc test_#t~nondet8; 1659#L77 assume !(0 != test_~tmp___0~0); 1658#L77-1 test_~tmp___2~0 := test_#t~nondet9;havoc test_#t~nondet9; 1656#L87 assume 0 != test_~tmp___2~0; 1423#L93-1 assume !(0 != ~pumpRunning~0); 1424#L130 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret11, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1615#L162 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret29, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~2, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~2;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~6;havoc isHighWaterSensorDry_~retValue_acc~6; 1592#L508 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~6 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~6; 1609#L513 isHighWaterLevel_#t~ret29 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~2 := isHighWaterLevel_#t~ret29;havoc isHighWaterLevel_#t~ret29; 1607#L264 assume 0 != isHighWaterLevel_~tmp~2;isHighWaterLevel_~tmp___0~1 := 0; 1605#L264-2 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1603#L270 processEnvironment_#t~ret11 := isHighWaterLevel_#res;processEnvironment_~tmp~1 := processEnvironment_#t~ret11;havoc processEnvironment_#t~ret11; 1590#L166 assume !(0 != processEnvironment_~tmp~1); 1591#L137 havoc __utac_acc__Specification3_spec__1_#t~ret30, __utac_acc__Specification3_spec__1_#t~ret31, __utac_acc__Specification3_spec__1_#t~ret32, __utac_acc__Specification3_spec__1_~tmp~3, __utac_acc__Specification3_spec__1_~tmp___0~2, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~3;havoc __utac_acc__Specification3_spec__1_~tmp___0~2;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~4;havoc isMethaneLevelCritical_~retValue_acc~4;isMethaneLevelCritical_~retValue_acc~4 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~4; 1602#L468 __utac_acc__Specification3_spec__1_#t~ret30 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~3 := __utac_acc__Specification3_spec__1_#t~ret30;havoc __utac_acc__Specification3_spec__1_#t~ret30; 1601#L301 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~3);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~5;havoc getWaterLevel_~retValue_acc~5;getWaterLevel_~retValue_acc~5 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~5; 1600#L500 __utac_acc__Specification3_spec__1_#t~ret31 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~2 := __utac_acc__Specification3_spec__1_#t~ret31;havoc __utac_acc__Specification3_spec__1_#t~ret31; 1598#L307 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~2); 1427#L307-1 [2021-07-06 20:24:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:24:30,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:30,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097249195] [2021-07-06 20:24:30,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:30,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:30,299 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:30,314 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:30,318 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1182032684, now seen corresponding path program 1 times [2021-07-06 20:24:30,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:30,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614793471] [2021-07-06 20:24:30,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:30,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:30,324 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:30,328 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:30,330 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1859629486, now seen corresponding path program 1 times [2021-07-06 20:24:30,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:30,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725658360] [2021-07-06 20:24:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:30,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:30,351 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:30,382 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:30,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:30,519 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-07-06 20:24:30,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:30,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-07-06 20:25:10,741 WARN L205 SmtUtils]: Spent 40.16 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:25:10,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:10,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:25:30,961 WARN L205 SmtUtils]: Spent 20.17 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:25:31,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:25:31 BoogieIcfgContainer [2021-07-06 20:25:31,062 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:25:31,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:25:31,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:25:31,063 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:25:31,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:28" (3/4) ... [2021-07-06 20:25:31,065 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:25:31,090 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:25:31,090 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:25:31,091 INFO L168 Benchmark]: Toolchain (without parser) took 63301.97 ms. Allocated memory was 56.6 MB in the beginning and 111.1 MB in the end (delta: 54.5 MB). Free memory was 40.3 MB in the beginning and 58.2 MB in the end (delta: -17.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,091 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 46.1 MB. Free memory is still 28.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:25:31,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.81 ms. Allocated memory is still 56.6 MB. Free memory was 40.2 MB in the beginning and 31.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 56.6 MB. Free memory was 31.3 MB in the beginning and 28.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,092 INFO L168 Benchmark]: Boogie Preprocessor took 41.84 ms. Allocated memory is still 56.6 MB. Free memory was 28.3 MB in the beginning and 26.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,092 INFO L168 Benchmark]: RCFGBuilder took 686.90 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 26.2 MB in the beginning and 44.0 MB in the end (delta: -17.8 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,092 INFO L168 Benchmark]: BuchiAutomizer took 62181.34 ms. Allocated memory was 69.2 MB in the beginning and 111.1 MB in the end (delta: 41.9 MB). Free memory was 44.0 MB in the beginning and 61.1 MB in the end (delta: -17.2 MB). Peak memory consumption was 71.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,093 INFO L168 Benchmark]: Witness Printer took 27.92 ms. Allocated memory is still 111.1 MB. Free memory was 61.1 MB in the beginning and 58.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:31,094 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08 ms. Allocated memory is still 46.1 MB. Free memory is still 28.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.81 ms. Allocated memory is still 56.6 MB. Free memory was 40.2 MB in the beginning and 31.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.15 ms. Allocated memory is still 56.6 MB. Free memory was 31.3 MB in the beginning and 28.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.84 ms. Allocated memory is still 56.6 MB. Free memory was 28.3 MB in the beginning and 26.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 686.90 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 26.2 MB in the beginning and 44.0 MB in the end (delta: -17.8 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 62181.34 ms. Allocated memory was 69.2 MB in the beginning and 111.1 MB in the end (delta: 41.9 MB). Free memory was 44.0 MB in the beginning and 61.1 MB in the end (delta: -17.2 MB). Peak memory consumption was 71.9 MB. Max. memory is 16.1 GB. * Witness Printer took 27.92 ms. Allocated memory is still 111.1 MB. Free memory was 61.1 MB in the beginning and 58.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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 330 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 61.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 48.2ms AutomataMinimizationTime, 3 MinimizatonAttempts, 290 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 330 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 396 SDtfs, 1042 SDslu, 1066 SDs, 0 SdLazy, 103 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 185.3ms Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 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: 57]: 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 {NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3034575a=83, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50ee3c62=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50c3254f=0, NULL=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ef7601f=0, NULL=25684, NULL=25691, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a191a1d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3de58a14=0, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@965eafa=0, NULL=25692, NULL=0, tmp___1=0, NULL=0, NULL=25672, NULL=25676, cleanupTimeShifts=4, tmp=0, tmp=0, NULL=25667, waterLevel=1, tmp___0=0, \result=1, head=0, pumpRunning=0, retValue_acc=1, NULL=25674, tmp=1, NULL=0, \result=1, NULL=0, NULL=0, NULL=25675, NULL=0, NULL=0, tmp=1, NULL=0, NULL=0, NULL=25693, retValue_acc=1, NULL=25679, NULL=25681, tmp=0, head=0, NULL=0, NULL=0, NULL=25690, NULL=0, NULL=0, NULL=25670, retValue_acc=0, NULL=25685, NULL=0, NULL=25683, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72ac3e75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27bc485d=0, NULL=25694, tmp___0=0, NULL=0, NULL=25682, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44f43c7a=0, NULL=25680, tmp___0=1, NULL=0, systemActive=1, \result=1, NULL=0, \result=0, retValue_acc=0, NULL=25668, NULL=25678, \result=0, NULL=25669, NULL=0, NULL=0, NULL=25671, NULL=25673, NULL=25687, retValue_acc=1, NULL=25688, tmp___2=83, splverifierCounter=0, NULL=0, \result=0, NULL=25689, tmp___1=0, NULL=0, NULL=0, NULL=25677, NULL=0, NULL=25686} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L122] int pumpRunning = 0; [L123] int systemActive = 1; [L326] int cleanupTimeShifts = 4; [L425] int waterLevel = 1; [L426] int methaneLevelCritical = 0; [L732] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L402] int retValue_acc ; [L403] int tmp ; [L545] int retValue_acc ; [L548] retValue_acc = 1 [L549] return (retValue_acc); [L409] tmp = valid_product() [L411] COND TRUE \read(tmp) [L48] int splverifierCounter ; [L49] int tmp ; [L50] int tmp___0 ; [L51] int tmp___1 ; [L52] int tmp___2 ; [L55] splverifierCounter = 0 Loop: [L57] COND TRUE 1 [L59] COND TRUE splverifierCounter < 4 [L65] tmp = __VERIFIER_nondet_int() [L67] COND FALSE !(\read(tmp)) [L75] tmp___0 = __VERIFIER_nondet_int() [L77] COND FALSE !(\read(tmp___0)) [L85] tmp___2 = __VERIFIER_nondet_int() [L87] COND TRUE \read(tmp___2) [L130] COND FALSE !(\read(pumpRunning)) [L137] COND TRUE \read(systemActive) [L159] int tmp ; [L162] COND TRUE ! pumpRunning [L256] int retValue_acc ; [L257] int tmp ; [L258] int tmp___0 ; [L505] int retValue_acc ; [L508] COND TRUE waterLevel < 2 [L509] retValue_acc = 1 [L510] return (retValue_acc); [L262] tmp = isHighWaterSensorDry() [L264] COND TRUE \read(tmp) [L265] tmp___0 = 0 [L269] retValue_acc = tmp___0 [L270] return (retValue_acc); [L164] tmp = isHighWaterLevel() [L166] COND FALSE !(\read(tmp)) [L293] int tmp ; [L294] int tmp___0 ; [L295] int tmp___1 ; [L464] int retValue_acc ; [L467] retValue_acc = methaneLevelCritical [L468] return (retValue_acc); [L299] tmp = isMethaneLevelCritical() [L301] COND FALSE !(\read(tmp)) [L496] int retValue_acc ; [L499] retValue_acc = waterLevel [L500] return (retValue_acc); [L305] tmp___0 = getWaterLevel() [L307] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:25:31,132 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...