./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product41_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product41_false-unreach-call_false-termination.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 59866f864e0ec5bf7736536ea91554085144fb1d .................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-2e94e6a [2019-01-01 23:47:35,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:47:35,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:47:35,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:47:35,855 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:47:35,856 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:47:35,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:47:35,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:47:35,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:47:35,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:47:35,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:47:35,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:47:35,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:47:35,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:47:35,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:47:35,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:47:35,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:47:35,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:47:35,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:47:35,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:47:35,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:47:35,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:47:35,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:47:35,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:47:35,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:47:35,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:47:35,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:47:35,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:47:35,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:47:35,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:47:35,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:47:35,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:47:35,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:47:35,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:47:35,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:47:35,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:47:35,921 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:47:35,951 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:47:35,951 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:47:35,952 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:47:35,952 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:47:35,955 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:47:35,956 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:47:35,956 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:47:35,957 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:47:35,957 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:47:35,957 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:47:35,957 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:47:35,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:47:35,958 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:47:35,958 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:47:35,958 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:47:35,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:47:35,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:47:35,959 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:47:35,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:47:35,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:47:35,960 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:47:35,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:47:35,960 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:47:35,960 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:47:35,960 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:47:35,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:47:35,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:47:35,964 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:47:35,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:47:35,964 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:47:35,964 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:47:35,965 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:47:35,965 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 59866f864e0ec5bf7736536ea91554085144fb1d [2019-01-01 23:47:36,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:47:36,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:47:36,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:47:36,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:47:36,029 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:47:36,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product41_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:36,090 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a410dc2e/69049371464d42fc949e30e4bf650aed/FLAG9f2753305 [2019-01-01 23:47:36,651 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:47:36,652 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product41_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:36,667 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a410dc2e/69049371464d42fc949e30e4bf650aed/FLAG9f2753305 [2019-01-01 23:47:36,949 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a410dc2e/69049371464d42fc949e30e4bf650aed [2019-01-01 23:47:36,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:47:36,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:47:36,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:36,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:47:36,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:47:36,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:36" (1/1) ... [2019-01-01 23:47:36,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:36, skipping insertion in model container [2019-01-01 23:47:36,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:36" (1/1) ... [2019-01-01 23:47:36,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:47:37,036 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:47:37,483 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:37,504 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:47:37,615 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:37,741 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:47:37,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37 WrapperNode [2019-01-01 23:47:37,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:37,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:37,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:47:37,747 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:47:37,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:37,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:47:37,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:47:37,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:47:37,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... [2019-01-01 23:47:37,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:47:37,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:47:37,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:47:37,894 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:47:37,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:47:37,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:47:37,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:47:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:47:37,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:47:39,220 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:47:39,221 INFO L280 CfgBuilder]: Removed 114 assue(true) statements. [2019-01-01 23:47:39,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:39 BoogieIcfgContainer [2019-01-01 23:47:39,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:47:39,222 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:47:39,222 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:47:39,225 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:47:39,226 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:39,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:47:36" (1/3) ... [2019-01-01 23:47:39,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@603a5ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:39, skipping insertion in model container [2019-01-01 23:47:39,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:39,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:37" (2/3) ... [2019-01-01 23:47:39,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@603a5ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:39, skipping insertion in model container [2019-01-01 23:47:39,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:39,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:39" (3/3) ... [2019-01-01 23:47:39,231 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product41_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:39,290 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:47:39,291 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:47:39,291 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:47:39,291 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:47:39,291 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:47:39,291 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:47:39,292 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:47:39,292 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:47:39,292 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:47:39,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-01 23:47:39,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:47:39,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:39,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:39,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:39,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:39,354 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:47:39,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states. [2019-01-01 23:47:39,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2019-01-01 23:47:39,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:39,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:39,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:39,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:39,369 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~cleanupTimeShifts~0 := 4; 9#L-1true havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 44#L194true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 57#L202true main_#t~ret72 := valid_product_#res;main_~tmp~8 := main_#t~ret72;havoc main_#t~ret72; 40#L904true assume 0 != main_~tmp~8; 16#L881true havoc test_#t~nondet48, test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 59#L151-1true [2019-01-01 23:47:39,369 INFO L796 eck$LassoCheckResult]: Loop: 59#L151-1true assume !false; 76#L595true assume test_~splverifierCounter~0 < 4; 10#L596true test_~tmp~4 := test_#t~nondet48;havoc test_#t~nondet48; 43#L604true assume !(0 != test_~tmp~4); 47#L604-1true test_~tmp___0~1 := test_#t~nondet49;havoc test_#t~nondet49; 19#L614true assume !(0 != test_~tmp___0~1); 22#L614-1true test_~tmp___2~0 := test_#t~nondet50;havoc test_#t~nondet50; 84#L624true assume 0 != test_~tmp___2~0; 37#L630-2true assume !(0 != ~pumpRunning~0); 39#L659true assume !(0 != ~systemActive~0); 49#L666true havoc __utac_acc__Specification4_spec__1_#t~ret10, __utac_acc__Specification4_spec__1_#t~ret11, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 52#L122true __utac_acc__Specification4_spec__1_#t~ret10 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret10;havoc __utac_acc__Specification4_spec__1_#t~ret10; 60#L151true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 59#L151-1true [2019-01-01 23:47:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:47:39,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1681191230, now seen corresponding path program 1 times [2019-01-01 23:47:40,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:40,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:40,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:40,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:40,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 33087708, now seen corresponding path program 1 times [2019-01-01 23:47:40,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:40,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:40,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:40,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:40,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:47:40,823 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:47:40,938 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 23:47:40,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:47:40,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:47:40,964 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 6 states. [2019-01-01 23:47:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:41,193 INFO L93 Difference]: Finished difference Result 84 states and 115 transitions. [2019-01-01 23:47:41,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:47:41,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 115 transitions. [2019-01-01 23:47:41,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-01 23:47:41,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 77 states and 108 transitions. [2019-01-01 23:47:41,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2019-01-01 23:47:41,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2019-01-01 23:47:41,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 108 transitions. [2019-01-01 23:47:41,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:41,211 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-01 23:47:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 108 transitions. [2019-01-01 23:47:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-01 23:47:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-01 23:47:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2019-01-01 23:47:41,250 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-01 23:47:41,250 INFO L608 BuchiCegarLoop]: Abstraction has 77 states and 108 transitions. [2019-01-01 23:47:41,250 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:47:41,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 108 transitions. [2019-01-01 23:47:41,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2019-01-01 23:47:41,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:41,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:41,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:41,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:41,254 INFO L794 eck$LassoCheckResult]: Stem: 243#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~cleanupTimeShifts~0 := 4; 200#L-1 havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 201#L194 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 247#L202 main_#t~ret72 := valid_product_#res;main_~tmp~8 := main_#t~ret72;havoc main_#t~ret72; 244#L904 assume 0 != main_~tmp~8; 216#L881 havoc test_#t~nondet48, test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 217#L151-1 [2019-01-01 23:47:41,254 INFO L796 eck$LassoCheckResult]: Loop: 217#L151-1 assume !false; 256#L595 assume test_~splverifierCounter~0 < 4; 202#L596 test_~tmp~4 := test_#t~nondet48;havoc test_#t~nondet48; 203#L604 assume !(0 != test_~tmp~4); 208#L604-1 test_~tmp___0~1 := test_#t~nondet49;havoc test_#t~nondet49; 218#L614 assume !(0 != test_~tmp___0~1); 219#L614-1 test_~tmp___2~0 := test_#t~nondet50;havoc test_#t~nondet50; 224#L624 assume 0 != test_~tmp___2~0; 240#L630-2 assume !(0 != ~pumpRunning~0); 241#L659 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret52, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 204#L691 assume !(0 == ~pumpRunning~0); 206#L666 havoc __utac_acc__Specification4_spec__1_#t~ret10, __utac_acc__Specification4_spec__1_#t~ret11, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 248#L122 __utac_acc__Specification4_spec__1_#t~ret10 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret10;havoc __utac_acc__Specification4_spec__1_#t~ret10; 251#L151 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 217#L151-1 [2019-01-01 23:47:41,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:47:41,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:41,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:41,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:41,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -619089829, now seen corresponding path program 1 times [2019-01-01 23:47:41,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:41,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:41,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:41,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:41,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:41,640 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:41,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:41,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:41,641 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. cyclomatic complexity: 33 Second operand 3 states. [2019-01-01 23:47:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:41,895 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2019-01-01 23:47:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:41,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 159 transitions. [2019-01-01 23:47:41,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 [2019-01-01 23:47:41,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 159 transitions. [2019-01-01 23:47:41,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2019-01-01 23:47:41,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2019-01-01 23:47:41,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 159 transitions. [2019-01-01 23:47:41,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:41,904 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-01-01 23:47:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 159 transitions. [2019-01-01 23:47:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-01-01 23:47:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 23:47:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 159 transitions. [2019-01-01 23:47:41,913 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-01-01 23:47:41,913 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 159 transitions. [2019-01-01 23:47:41,913 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:47:41,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 159 transitions. [2019-01-01 23:47:41,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 82 [2019-01-01 23:47:41,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:41,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:41,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:41,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:41,917 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(30);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(9);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(21);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(30);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(9);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(21);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(30);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(9);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(25);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(30);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(9);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(13);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(110, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string60.base, #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(102, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 3 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string62.base, #t~string62.offset, 1);call write~init~int(80, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(117, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(109, #t~string62.base, 3 + #t~string62.offset, 1);call write~init~int(112, #t~string62.base, 4 + #t~string62.offset, 1);call write~init~int(58, #t~string62.base, 5 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 6 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(110, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 2 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string66.base, #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(102, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string68.base, #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string70.base, #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 1 + #t~string70.offset, 1);~cleanupTimeShifts~0 := 4; 398#L-1 havoc main_#res;havoc main_#t~ret72, main_~retValue_acc~11, main_~tmp~8;havoc main_~retValue_acc~11;havoc main_~tmp~8; 399#L194 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 448#L202 main_#t~ret72 := valid_product_#res;main_~tmp~8 := main_#t~ret72;havoc main_#t~ret72; 446#L904 assume 0 != main_~tmp~8; 411#L881 havoc test_#t~nondet48, test_#t~nondet49, test_#t~nondet50, test_#t~nondet51, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 412#L151-1 [2019-01-01 23:47:41,918 INFO L796 eck$LassoCheckResult]: Loop: 412#L151-1 assume !false; 482#L595 assume test_~splverifierCounter~0 < 4; 481#L596 test_~tmp~4 := test_#t~nondet48;havoc test_#t~nondet48; 480#L604 assume !(0 != test_~tmp~4); 478#L604-1 test_~tmp___0~1 := test_#t~nondet49;havoc test_#t~nondet49; 477#L614 assume !(0 != test_~tmp___0~1); 475#L614-1 test_~tmp___2~0 := test_#t~nondet50;havoc test_#t~nondet50; 474#L624 assume 0 != test_~tmp___2~0; 443#L630-2 assume !(0 != ~pumpRunning~0); 444#L659 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret52, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 405#L691 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret71, isHighWaterLevel_~retValue_acc~10, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~10;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 406#L130 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 393#L135 isHighWaterLevel_#t~ret71 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret71;havoc isHighWaterLevel_#t~ret71; 394#L811 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~2 := 0; 395#L811-2 isHighWaterLevel_~retValue_acc~10 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~10; 465#L817 processEnvironment_#t~ret52 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret52;havoc processEnvironment_#t~ret52; 430#L695 assume !(0 != processEnvironment_~tmp~5); 427#L666 havoc __utac_acc__Specification4_spec__1_#t~ret10, __utac_acc__Specification4_spec__1_#t~ret11, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 486#L122 __utac_acc__Specification4_spec__1_#t~ret10 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret10;havoc __utac_acc__Specification4_spec__1_#t~ret10; 484#L151 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 412#L151-1 [2019-01-01 23:47:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:41,918 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:47:41,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:41,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:41,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:42,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -21695257, now seen corresponding path program 1 times [2019-01-01 23:47:42,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:42,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:42,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash -6983283, now seen corresponding path program 1 times [2019-01-01 23:47:42,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:43,526 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 23:47:43,965 WARN L181 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 23:48:14,812 WARN L181 SmtUtils]: Spent 30.83 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:48:29,985 WARN L181 SmtUtils]: Spent 15.17 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:48:30,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:48:30 BoogieIcfgContainer [2019-01-01 23:48:30,068 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:48:30,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:48:30,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:48:30,070 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:48:30,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:39" (3/4) ... [2019-01-01 23:48:30,076 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:48:30,184 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:48:30,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:48:30,185 INFO L168 Benchmark]: Toolchain (without parser) took 53228.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 952.7 MB in the beginning and 924.4 MB in the end (delta: 28.3 MB). Peak memory consumption was 357.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:30,186 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:30,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:30,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:30,188 INFO L168 Benchmark]: Boogie Preprocessor took 64.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:30,188 INFO L168 Benchmark]: RCFGBuilder took 1327.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:30,191 INFO L168 Benchmark]: BuchiAutomizer took 50846.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 926.4 MB in the end (delta: 148.9 MB). Peak memory consumption was 416.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:30,191 INFO L168 Benchmark]: Witness Printer took 114.49 ms. Allocated memory is still 1.4 GB. Free memory was 926.4 MB in the beginning and 924.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:30,195 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 787.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1327.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 50846.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 926.4 MB in the end (delta: 148.9 MB). Peak memory consumption was 416.9 MB. Max. memory is 11.5 GB. * Witness Printer took 114.49 ms. Allocated memory is still 1.4 GB. Free memory was 926.4 MB in the beginning and 924.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 118 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 50.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 118 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 216 SDtfs, 529 SDslu, 50 SDs, 0 SdLazy, 29 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 594]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=3636} State at position 1 is {NULL=0, NULL=0, NULL=0, NULL=-14, NULL=3636, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b3ff3c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2218e3e7=0, NULL=0, NULL=0, NULL=0, NULL=-3, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79d87328=0, NULL=-23, NULL=-11, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72920ec6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29599a08=64, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@724558fa=0, tmp___0=0, tmp=0, NULL=-17, NULL=0, NULL=-16, NULL=0, NULL=-2, tmp___1=0, tmp___0=0, NULL=-19, cleanupTimeShifts=4, NULL=-12, NULL=-1, NULL=-8, NULL=-22, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=-20, \result=0, NULL=-7, NULL=-18, NULL=0, NULL=0, retValue_acc=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29630e19=0, NULL=0, NULL=-24, retValue_acc=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b4caed2=0, NULL=0, NULL=0, NULL=0, tmp=1, NULL=0, NULL=-6, \result=1, retValue_acc=1, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@780e7c4e=0, retValue_acc=0, NULL=-10, tmp=1, tmp___2=64, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-13, NULL=3635, head=0, tmp=0, NULL=-5, NULL=-9, NULL=0, NULL=-4, NULL=-15, NULL=-21} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L385] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L652] int pumpRunning = 0; [L653] int systemActive = 1; [L822] int cleanupTimeShifts = 4; [L895] int retValue_acc ; [L896] int tmp ; [L198] int retValue_acc ; [L201] retValue_acc = 1 [L202] return (retValue_acc); [L902] tmp = valid_product() [L904] COND TRUE \read(tmp) [L585] int splverifierCounter ; [L586] int tmp ; [L587] int tmp___0 ; [L588] int tmp___1 ; [L589] int tmp___2 ; [L592] splverifierCounter = 0 Loop: [L594] COND TRUE 1 [L596] COND TRUE splverifierCounter < 4 [L602] tmp = __VERIFIER_nondet_int() [L604] COND FALSE !(\read(tmp)) [L612] tmp___0 = __VERIFIER_nondet_int() [L614] COND FALSE !(\read(tmp___0)) [L622] tmp___2 = __VERIFIER_nondet_int() [L624] COND TRUE \read(tmp___2) [L659] COND FALSE !(\read(pumpRunning)) [L666] COND TRUE \read(systemActive) [L688] int tmp ; [L691] COND TRUE ! pumpRunning [L803] int retValue_acc ; [L804] int tmp ; [L805] int tmp___0 ; [L127] int retValue_acc ; [L130] COND TRUE waterLevel < 2 [L131] retValue_acc = 1 [L132] return (retValue_acc); [L809] tmp = isHighWaterSensorDry() [L811] COND TRUE \read(tmp) [L812] tmp___0 = 0 [L816] retValue_acc = tmp___0 [L817] return (retValue_acc); [L693] tmp = isHighWaterLevel() [L695] COND FALSE !(\read(tmp)) [L144] int tmp ; [L145] int tmp___0 ; [L118] int retValue_acc ; [L121] retValue_acc = waterLevel [L122] return (retValue_acc); [L149] tmp = getWaterLevel() [L151] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...