./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product06_true-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_spec5_product06_true-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 dfe06fc1ef2f52cf03ee60bd1d5f57aaa8aba092 .................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:49:33,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:49:33,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:49:33,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:49:33,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:49:33,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:49:33,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:49:33,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:49:33,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:49:33,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:49:33,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:49:33,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:49:33,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:49:33,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:49:33,848 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:49:33,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:49:33,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:49:33,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:49:33,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:49:33,856 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:49:33,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:49:33,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:49:33,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:49:33,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:49:33,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:49:33,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:49:33,867 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:49:33,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:49:33,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:49:33,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:49:33,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:49:33,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:49:33,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:49:33,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:49:33,873 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:49:33,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:49:33,874 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:49:33,891 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:49:33,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:49:33,893 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:49:33,893 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:49:33,893 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:49:33,893 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:49:33,893 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:49:33,894 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:49:33,895 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:49:33,895 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:49:33,895 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:49:33,895 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:49:33,895 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:49:33,895 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:49:33,896 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:49:33,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:49:33,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:49:33,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:49:33,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:49:33,897 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:49:33,897 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:49:33,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:49:33,898 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:49:33,898 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:49:33,898 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:49:33,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:49:33,900 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:49:33,900 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:49:33,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:49:33,900 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:49:33,901 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:49:33,902 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:49:33,903 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 -> dfe06fc1ef2f52cf03ee60bd1d5f57aaa8aba092 [2019-01-01 23:49:33,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:49:33,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:49:33,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:49:33,958 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:49:33,958 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:49:33,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product06_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:34,020 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4443a43/f2326fdc0f754f17965988c9d6afea07/FLAGd97e6d94f [2019-01-01 23:49:34,532 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:49:34,533 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product06_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:34,547 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4443a43/f2326fdc0f754f17965988c9d6afea07/FLAGd97e6d94f [2019-01-01 23:49:34,821 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4443a43/f2326fdc0f754f17965988c9d6afea07 [2019-01-01 23:49:34,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:49:34,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:49:34,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:49:34,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:49:34,834 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:49:34,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:49:34" (1/1) ... [2019-01-01 23:49:34,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:34, skipping insertion in model container [2019-01-01 23:49:34,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:49:34" (1/1) ... [2019-01-01 23:49:34,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:49:34,891 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:49:35,247 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:49:35,272 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:49:35,403 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:49:35,455 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:49:35,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35 WrapperNode [2019-01-01 23:49:35,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:49:35,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:49:35,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:49:35,458 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:49:35,539 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:49:35" (1/1) ... [2019-01-01 23:49:35,569 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:49:35" (1/1) ... [2019-01-01 23:49:35,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:49:35,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:49:35,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:49:35,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:49:35,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:35,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:49:35,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:49:35,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:49:35,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:49:35,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (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:49:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:49:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:49:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:49:35,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:49:36,928 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:49:36,928 INFO L280 CfgBuilder]: Removed 112 assue(true) statements. [2019-01-01 23:49:36,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:36 BoogieIcfgContainer [2019-01-01 23:49:36,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:49:36,930 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:49:36,930 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:49:36,935 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:49:36,936 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:36,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:49:34" (1/3) ... [2019-01-01 23:49:36,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3971a3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:49:36, skipping insertion in model container [2019-01-01 23:49:36,938 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:36,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:35" (2/3) ... [2019-01-01 23:49:36,938 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3971a3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:49:36, skipping insertion in model container [2019-01-01 23:49:36,939 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:36,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:36" (3/3) ... [2019-01-01 23:49:36,940 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product06_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:37,010 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:49:37,012 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:49:37,012 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:49:37,012 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:49:37,013 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:49:37,013 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:49:37,013 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:49:37,013 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:49:37,014 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:49:37,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-01 23:49:37,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-01 23:49:37,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:37,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:37,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:37,113 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:37,113 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:49:37,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-01 23:49:37,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-01 23:49:37,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:37,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:37,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:37,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:37,134 INFO L794 eck$LassoCheckResult]: Stem: 28#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);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #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(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25); 8#L-1true havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~6, main_~tmp~2;havoc main_~retValue_acc~6;havoc main_~tmp~2; 51#L151true havoc valid_product_#res;havoc valid_product_~retValue_acc~3;havoc valid_product_~retValue_acc~3;valid_product_~retValue_acc~3 := 1;valid_product_#res := valid_product_~retValue_acc~3; 71#L159true main_#t~ret33 := valid_product_#res;main_~tmp~2 := main_#t~ret33;havoc main_#t~ret33; 9#L468true assume 0 != main_~tmp~2; 31#L443true ~switchedOnBeforeTS~0 := 0; 72#L489true havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, 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; 48#L510-1true [2019-01-01 23:49:37,144 INFO L796 eck$LassoCheckResult]: Loop: 48#L510-1true assume !false; 67#L178true assume test_~splverifierCounter~0 < 4; 6#L179true test_~tmp~0 := test_#t~nondet11;havoc test_#t~nondet11; 22#L187true assume !(0 != test_~tmp~0); 19#L187-1true test_~tmp___0~0 := test_#t~nondet12;havoc test_#t~nondet12; 3#L197true assume !(0 != test_~tmp___0~0); 17#L197-1true test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 61#L207true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 11#L215-2true havoc __utac_acc__Specification5_spec__2_#t~ret34;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 77#L335true __utac_acc__Specification5_spec__2_#t~ret34 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret34;havoc __utac_acc__Specification5_spec__2_#t~ret34; 46#L499true assume !(0 != ~pumpRunning~0); 39#L250true assume !(0 != ~systemActive~0); 50#L257true havoc __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_#t~ret36, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;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; 37#L121true __utac_acc__Specification5_spec__3_#t~ret35 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret35;havoc __utac_acc__Specification5_spec__3_#t~ret35; 43#L510true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 48#L510-1true [2019-01-01 23:49:37,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:49:37,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:37,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:37,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:37,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:38,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1011068557, now seen corresponding path program 1 times [2019-01-01 23:49:38,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:38,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:38,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:38,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:49:38,104 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:49:38,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:49:38,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:49:38,113 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:49:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:49:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:49:38,138 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-01-01 23:49:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:49:38,206 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2019-01-01 23:49:38,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:49:38,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 101 transitions. [2019-01-01 23:49:38,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-01 23:49:38,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 93 transitions. [2019-01-01 23:49:38,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-01 23:49:38,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-01 23:49:38,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 93 transitions. [2019-01-01 23:49:38,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:49:38,223 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-01-01 23:49:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 93 transitions. [2019-01-01 23:49:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-01 23:49:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 23:49:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2019-01-01 23:49:38,255 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-01-01 23:49:38,255 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2019-01-01 23:49:38,256 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:49:38,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 93 transitions. [2019-01-01 23:49:38,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-01 23:49:38,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:38,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:38,260 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:38,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:38,261 INFO L794 eck$LassoCheckResult]: Stem: 197#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);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #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(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25); 170#L-1 havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~6, main_~tmp~2;havoc main_~retValue_acc~6;havoc main_~tmp~2; 171#L151 havoc valid_product_#res;havoc valid_product_~retValue_acc~3;havoc valid_product_~retValue_acc~3;valid_product_~retValue_acc~3 := 1;valid_product_#res := valid_product_~retValue_acc~3; 219#L159 main_#t~ret33 := valid_product_#res;main_~tmp~2 := main_#t~ret33;havoc main_#t~ret33; 172#L468 assume 0 != main_~tmp~2; 173#L443 ~switchedOnBeforeTS~0 := 0; 203#L489 havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, 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; 163#L510-1 [2019-01-01 23:49:38,261 INFO L796 eck$LassoCheckResult]: Loop: 163#L510-1 assume !false; 217#L178 assume test_~splverifierCounter~0 < 4; 166#L179 test_~tmp~0 := test_#t~nondet11;havoc test_#t~nondet11; 167#L187 assume !(0 != test_~tmp~0); 182#L187-1 test_~tmp___0~0 := test_#t~nondet12;havoc test_#t~nondet12; 159#L197 assume !(0 != test_~tmp___0~0); 161#L197-1 test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 179#L207 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 176#L215-2 havoc __utac_acc__Specification5_spec__2_#t~ret34;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 177#L335 __utac_acc__Specification5_spec__2_#t~ret34 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret34;havoc __utac_acc__Specification5_spec__2_#t~ret34; 216#L499 assume !(0 != ~pumpRunning~0); 196#L250 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 183#L282 assume !(0 != ~pumpRunning~0); 184#L257 havoc __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_#t~ret36, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;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; 209#L121 __utac_acc__Specification5_spec__3_#t~ret35 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret35;havoc __utac_acc__Specification5_spec__3_#t~ret35; 210#L510 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 163#L510-1 [2019-01-01 23:49:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:49:38,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:38,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:38,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:38,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1257825731, now seen corresponding path program 1 times [2019-01-01 23:49:38,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:38,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:38,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:49:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:38,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1083065097, now seen corresponding path program 1 times [2019-01-01 23:49:38,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:38,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:38,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:49:38,799 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:49:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:49:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:49:39,152 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 23:49:39,393 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:49:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:49:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:49:39,406 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. cyclomatic complexity: 27 Second operand 5 states. [2019-01-01 23:49:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:49:39,882 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2019-01-01 23:49:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:49:39,884 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 255 transitions. [2019-01-01 23:49:39,889 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2019-01-01 23:49:39,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 255 transitions. [2019-01-01 23:49:39,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2019-01-01 23:49:39,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2019-01-01 23:49:39,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 255 transitions. [2019-01-01 23:49:39,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:49:39,896 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 255 transitions. [2019-01-01 23:49:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 255 transitions. [2019-01-01 23:49:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 129. [2019-01-01 23:49:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 23:49:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2019-01-01 23:49:39,912 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-01-01 23:49:39,912 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2019-01-01 23:49:39,912 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:49:39,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 172 transitions. [2019-01-01 23:49:39,915 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2019-01-01 23:49:39,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:39,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:39,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:39,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:39,918 INFO L794 eck$LassoCheckResult]: Stem: 469#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);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(13);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string24.base, #t~string24.offset, 1);call write~init~int(80, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(117, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(109, #t~string24.base, 3 + #t~string24.offset, 1);call write~init~int(112, #t~string24.base, 4 + #t~string24.offset, 1);call write~init~int(58, #t~string24.base, 5 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 6 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string26.base, #t~string26.offset, 1);call write~init~int(110, #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(4);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(102, #t~string28.base, 2 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 3 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string30.base, #t~string30.offset, 1);call write~init~int(32, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 2 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string32.base, #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 1 + #t~string32.offset, 1);~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(30);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(9);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(21);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(30);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(9);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(21);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(25);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(25); 442#L-1 havoc main_#res;havoc main_#t~ret33, main_~retValue_acc~6, main_~tmp~2;havoc main_~retValue_acc~6;havoc main_~tmp~2; 443#L151 havoc valid_product_#res;havoc valid_product_~retValue_acc~3;havoc valid_product_~retValue_acc~3;valid_product_~retValue_acc~3 := 1;valid_product_#res := valid_product_~retValue_acc~3; 502#L159 main_#t~ret33 := valid_product_#res;main_~tmp~2 := main_#t~ret33;havoc main_#t~ret33; 444#L468 assume 0 != main_~tmp~2; 445#L443 ~switchedOnBeforeTS~0 := 0; 477#L489 havoc test_#t~nondet11, test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, 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; 495#L510-1 [2019-01-01 23:49:39,918 INFO L796 eck$LassoCheckResult]: Loop: 495#L510-1 assume !false; 496#L178 assume test_~splverifierCounter~0 < 4; 438#L179 test_~tmp~0 := test_#t~nondet11;havoc test_#t~nondet11; 439#L187 assume !(0 != test_~tmp~0); 457#L187-1 test_~tmp___0~0 := test_#t~nondet12;havoc test_#t~nondet12; 431#L197 assume !(0 != test_~tmp___0~0); 433#L197-1 test_~tmp___2~0 := test_#t~nondet13;havoc test_#t~nondet13; 451#L207 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 448#L215-2 havoc __utac_acc__Specification5_spec__2_#t~ret34;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 449#L335 __utac_acc__Specification5_spec__2_#t~ret34 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret34;havoc __utac_acc__Specification5_spec__2_#t~ret34; 494#L499 assume !(0 != ~pumpRunning~0); 487#L250 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret15, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 454#L282 assume !(0 != ~pumpRunning~0); 455#L257 havoc __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_#t~ret36, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;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; 483#L121 __utac_acc__Specification5_spec__3_#t~ret35 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret35;havoc __utac_acc__Specification5_spec__3_#t~ret35; 484#L510 assume 2 != __utac_acc__Specification5_spec__3_~tmp~3;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 491#L335-1 __utac_acc__Specification5_spec__3_#t~ret36 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~1 := __utac_acc__Specification5_spec__3_#t~ret36;havoc __utac_acc__Specification5_spec__3_#t~ret36; 508#L514 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~1); 495#L510-1 [2019-01-01 23:49:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:49:39,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:39,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:40,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:40,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1884702974, now seen corresponding path program 1 times [2019-01-01 23:49:40,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:40,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:49:40,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:40,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1443458244, now seen corresponding path program 1 times [2019-01-01 23:49:40,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:40,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:40,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:41,379 WARN L181 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-01-01 23:49:41,799 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:50:10,285 WARN L181 SmtUtils]: Spent 28.48 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:50:24,025 WARN L181 SmtUtils]: Spent 13.73 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:50:24,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:50:24 BoogieIcfgContainer [2019-01-01 23:50:24,154 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:50:24,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:50:24,156 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:50:24,157 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:50:24,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:36" (3/4) ... [2019-01-01 23:50:24,161 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:50:24,237 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:50:24,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:50:24,238 INFO L168 Benchmark]: Toolchain (without parser) took 49412.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 951.3 MB in the beginning and 974.8 MB in the end (delta: -23.5 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:24,240 INFO L168 Benchmark]: CDTParser took 0.16 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:50:24,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.28 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:24,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:24,241 INFO L168 Benchmark]: Boogie Preprocessor took 41.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:50:24,243 INFO L168 Benchmark]: RCFGBuilder took 1254.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:24,243 INFO L168 Benchmark]: BuchiAutomizer took 47224.20 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 66.0 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:24,244 INFO L168 Benchmark]: Witness Printer took 81.50 ms. Allocated memory is still 1.3 GB. Free memory was 987.6 MB in the beginning and 974.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:24,250 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.16 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 626.28 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 924.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 175.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1254.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47224.20 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 66.0 MB). Peak memory consumption was 432.7 MB. Max. memory is 11.5 GB. * Witness Printer took 81.50 ms. Allocated memory is still 1.3 GB. Free memory was 987.6 MB in the beginning and 974.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 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 5 locations. The remainder module has 129 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 59 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 241 SDtfs, 372 SDslu, 272 SDs, 0 SdLazy, 70 SolverSat, 22 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: 177]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=8881} State at position 1 is {NULL=0, NULL=0, NULL=-18, NULL=-25, NULL=8881, retValue_acc=0, NULL=-22, NULL=0, NULL=-14, NULL=-19, methaneLevelCritical=0, tmp=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-13, NULL=0, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d4ff0d7=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7cc71a8e=0, NULL=-10, cleanupTimeShifts=4, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d49275c=0, switchedOnBeforeTS=0, \result=0, NULL=0, systemActive=1, waterLevel=1, NULL=8880, \result=1, NULL=0, NULL=0, NULL=-5, tmp___0=0, NULL=-6, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, retValue_acc=1, NULL=-3, head=0, pumpRunning=0, NULL=-1, \result=0, tmp___0=0, NULL=-17, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37c2e0c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49b15fe7=0, NULL=0, retValue_acc=1, NULL=-21, NULL=-7, NULL=-24, tmp___2=61, NULL=-11, NULL=-9, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10bd7420=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bb78c2=61, NULL=-12, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29b1a09e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15d3d2a3=0, head=0, NULL=0, NULL=0, NULL=-15, NULL=0, NULL=0, NULL=-16, NULL=-23, NULL=0, NULL=-20, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L46] int waterLevel = 1; [L47] int methaneLevelCritical = 0; [L238] int pumpRunning = 0; [L239] int systemActive = 1; [L384] int cleanupTimeShifts = 4; [L483] int switchedOnBeforeTS ; [L701] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L459] int retValue_acc ; [L460] int tmp ; [L155] int retValue_acc ; [L158] retValue_acc = 1 [L159] return (retValue_acc); [L466] tmp = valid_product() [L468] COND TRUE \read(tmp) [L488] switchedOnBeforeTS = 0 [L168] int splverifierCounter ; [L169] int tmp ; [L170] int tmp___0 ; [L171] int tmp___1 ; [L172] int tmp___2 ; [L175] splverifierCounter = 0 Loop: [L177] COND TRUE 1 [L179] COND TRUE splverifierCounter < 4 [L185] tmp = __VERIFIER_nondet_int() [L187] COND FALSE !(\read(tmp)) [L195] tmp___0 = __VERIFIER_nondet_int() [L197] COND FALSE !(\read(tmp___0)) [L205] tmp___2 = __VERIFIER_nondet_int() [L207] COND TRUE \read(tmp___2) [L379] systemActive = 1 [L331] int retValue_acc ; [L334] retValue_acc = pumpRunning [L335] return (retValue_acc); [L497] switchedOnBeforeTS = isPumpRunning() [L250] COND FALSE !(\read(pumpRunning)) [L257] COND TRUE \read(systemActive) [L279] int tmp ; [L282] COND FALSE !(\read(pumpRunning)) [L503] int tmp ; [L504] int tmp___0 ; [L117] int retValue_acc ; [L120] retValue_acc = waterLevel [L121] return (retValue_acc); [L508] tmp = getWaterLevel() [L510] COND TRUE tmp != 2 [L331] int retValue_acc ; [L334] retValue_acc = pumpRunning [L335] return (retValue_acc); [L512] tmp___0 = isPumpRunning() [L514] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...