./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product45_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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_product45_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 a9369a06c8d4df60e49baaf177cf32aba3e52d93 ..................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0ed9222-m [2019-01-14 04:27:36,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:27:36,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:27:36,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:27:36,807 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:27:36,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:27:36,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:27:36,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:27:36,816 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:27:36,817 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:27:36,818 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:27:36,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:27:36,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:27:36,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:27:36,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:27:36,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:27:36,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:27:36,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:27:36,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:27:36,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:27:36,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:27:36,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:27:36,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:27:36,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:27:36,849 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:27:36,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:27:36,853 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:27:36,856 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:27:36,857 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:27:36,859 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:27:36,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:27:36,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:27:36,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:27:36,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:27:36,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:27:36,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:27:36,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:27:36,892 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:27:36,892 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:27:36,895 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:27:36,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:27:36,896 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:27:36,896 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:27:36,896 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:27:36,896 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:27:36,896 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:27:36,897 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:27:36,897 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:27:36,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:27:36,897 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:27:36,897 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:27:36,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:27:36,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:27:36,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:27:36,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:27:36,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:27:36,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:27:36,902 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:27:36,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:27:36,903 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:27:36,903 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:27:36,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:27:36,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:27:36,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:27:36,904 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:27:36,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:27:36,904 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:27:36,904 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:27:36,905 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:27:36,905 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 -> a9369a06c8d4df60e49baaf177cf32aba3e52d93 [2019-01-14 04:27:36,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:27:36,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:27:36,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:27:36,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:27:36,964 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:27:36,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product45_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:37,033 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f9456ef/746ba3596c0a4f868a090e7c16515545/FLAGfda806dc9 [2019-01-14 04:27:37,494 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:27:37,495 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product45_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:37,511 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f9456ef/746ba3596c0a4f868a090e7c16515545/FLAGfda806dc9 [2019-01-14 04:27:37,830 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48f9456ef/746ba3596c0a4f868a090e7c16515545 [2019-01-14 04:27:37,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:27:37,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:27:37,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:27:37,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:27:37,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:27:37,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:27:37" (1/1) ... [2019-01-14 04:27:37,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637dd565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:37, skipping insertion in model container [2019-01-14 04:27:37,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:27:37" (1/1) ... [2019-01-14 04:27:37,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:27:37,915 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:27:38,263 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:27:38,298 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:27:38,442 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:27:38,488 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:27:38,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38 WrapperNode [2019-01-14 04:27:38,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:27:38,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:27:38,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:27:38,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:27:38,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:27:38,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:27:38,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:27:38,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:27:38,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (1/1) ... [2019-01-14 04:27:38,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:27:38,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:27:38,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:27:38,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:27:38,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (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-14 04:27:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:27:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:27:38,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:27:38,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:27:40,059 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:27:40,060 INFO L286 CfgBuilder]: Removed 192 assue(true) statements. [2019-01-14 04:27:40,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:40 BoogieIcfgContainer [2019-01-14 04:27:40,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:27:40,062 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:27:40,062 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:27:40,066 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:27:40,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:40,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:27:37" (1/3) ... [2019-01-14 04:27:40,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c4850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:27:40, skipping insertion in model container [2019-01-14 04:27:40,069 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:40,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:27:38" (2/3) ... [2019-01-14 04:27:40,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c4850a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:27:40, skipping insertion in model container [2019-01-14 04:27:40,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:27:40,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:40" (3/3) ... [2019-01-14 04:27:40,072 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product45_false-unreach-call_false-termination.cil.c [2019-01-14 04:27:40,128 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:27:40,129 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:27:40,129 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:27:40,129 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:27:40,129 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:27:40,129 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:27:40,130 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:27:40,130 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:27:40,130 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:27:40,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states. [2019-01-14 04:27:40,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-14 04:27:40,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:40,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:40,195 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:40,195 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:40,196 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:27:40,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states. [2019-01-14 04:27:40,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2019-01-14 04:27:40,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:40,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:40,206 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:40,206 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:40,213 INFO L794 eck$LassoCheckResult]: Stem: 75#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(21);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 11#L-1true havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~6, main_~tmp~9;havoc main_~retValue_acc~6;havoc main_~tmp~9; 91#L930true havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 116#L938true main_#t~ret62 := valid_product_#res;main_~tmp~9 := main_#t~ret62;havoc main_#t~ret62; 7#L800true assume 0 != main_~tmp~9; 48#L774true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, 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; 39#L697-1true [2019-01-14 04:27:40,214 INFO L796 eck$LassoCheckResult]: Loop: 39#L697-1true assume !false; 79#L55true assume test_~splverifierCounter~0 < 4; 35#L56true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 45#L64true assume !(0 != test_~tmp~0); 44#L64-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 99#L74true assume !(0 != test_~tmp___0~0); 70#L74-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 10#L84true assume 0 != test_~tmp___2~0; 125#L90-2true assume !(0 != ~pumpRunning~0); 18#L125true assume !(0 != ~systemActive~0); 87#L132true havoc __utac_acc__Specification4_spec__1_#t~ret60, __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_~tmp~8, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~8;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 61#L889true __utac_acc__Specification4_spec__1_#t~ret60 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~8 := __utac_acc__Specification4_spec__1_#t~ret60;havoc __utac_acc__Specification4_spec__1_#t~ret60; 38#L697true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8); 39#L697-1true [2019-01-14 04:27:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:27:40,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:40,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:40,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:40,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1679313406, now seen corresponding path program 1 times [2019-01-14 04:27:41,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:41,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:41,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:41,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:41,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash 34965532, now seen corresponding path program 1 times [2019-01-14 04:27:41,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:41,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:41,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:41,505 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-14 04:27:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:41,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:27:41,679 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:27:41,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:27:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:27:41,753 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 6 states. [2019-01-14 04:27:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:41,949 INFO L93 Difference]: Finished difference Result 126 states and 178 transitions. [2019-01-14 04:27:41,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:27:41,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 178 transitions. [2019-01-14 04:27:41,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-14 04:27:41,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 119 states and 171 transitions. [2019-01-14 04:27:41,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2019-01-14 04:27:41,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2019-01-14 04:27:41,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 171 transitions. [2019-01-14 04:27:41,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:41,973 INFO L706 BuchiCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-01-14 04:27:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 171 transitions. [2019-01-14 04:27:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-14 04:27:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 04:27:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2019-01-14 04:27:42,009 INFO L729 BuchiCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-01-14 04:27:42,009 INFO L609 BuchiCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-01-14 04:27:42,009 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:27:42,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 171 transitions. [2019-01-14 04:27:42,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2019-01-14 04:27:42,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:42,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:42,014 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:42,014 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:42,014 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(21);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 287#L-1 havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~6, main_~tmp~9;havoc main_~retValue_acc~6;havoc main_~tmp~9; 288#L930 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 375#L938 main_#t~ret62 := valid_product_#res;main_~tmp~9 := main_#t~ret62;havoc main_#t~ret62; 279#L800 assume 0 != main_~tmp~9; 280#L774 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, 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; 327#L697-1 [2019-01-14 04:27:42,015 INFO L796 eck$LassoCheckResult]: Loop: 327#L697-1 assume !false; 331#L55 assume test_~splverifierCounter~0 < 4; 323#L56 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 324#L64 assume !(0 != test_~tmp~0); 336#L64-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 339#L74 assume !(0 != test_~tmp___0~0); 276#L74-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 284#L84 assume 0 != test_~tmp___2~0; 285#L90-2 assume !(0 != ~pumpRunning~0); 298#L125 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 299#L183 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret4, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 314#L157-1 assume !(0 == ~pumpRunning~0); 271#L132 havoc __utac_acc__Specification4_spec__1_#t~ret60, __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_~tmp~8, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~8;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 352#L889 __utac_acc__Specification4_spec__1_#t~ret60 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~8 := __utac_acc__Specification4_spec__1_#t~ret60;havoc __utac_acc__Specification4_spec__1_#t~ret60; 326#L697 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8); 327#L697-1 [2019-01-14 04:27:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:27:42,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:42,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:42,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1992761180, now seen corresponding path program 1 times [2019-01-14 04:27:42,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:42,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:42,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:42,403 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-14 04:27:42,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:42,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:27:42,404 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:27:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:27:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:27:42,404 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-01-14 04:27:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:43,110 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2019-01-14 04:27:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:27:43,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 219 transitions. [2019-01-14 04:27:43,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-14 04:27:43,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 219 transitions. [2019-01-14 04:27:43,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2019-01-14 04:27:43,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2019-01-14 04:27:43,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 219 transitions. [2019-01-14 04:27:43,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:43,124 INFO L706 BuchiCegarLoop]: Abstraction has 160 states and 219 transitions. [2019-01-14 04:27:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 219 transitions. [2019-01-14 04:27:43,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-01-14 04:27:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-14 04:27:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2019-01-14 04:27:43,145 INFO L729 BuchiCegarLoop]: Abstraction has 160 states and 219 transitions. [2019-01-14 04:27:43,145 INFO L609 BuchiCegarLoop]: Abstraction has 160 states and 219 transitions. [2019-01-14 04:27:43,145 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:27:43,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 219 transitions. [2019-01-14 04:27:43,150 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 110 [2019-01-14 04:27:43,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:43,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:43,152 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:43,152 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:43,152 INFO L794 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~head~0.base, ~head~0.offset := 0, 0;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(21);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(30);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(9);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(21);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(30);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(9);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(25);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(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(13);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string66.base, #t~string66.offset, 1);call write~init~int(77, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(101, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(104, #t~string66.base, 4 + #t~string66.offset, 1);call write~init~int(58, #t~string66.base, 5 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 6 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string68.base, #t~string68.offset, 1);call write~init~int(82, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(73, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(84, #t~string68.base, 3 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 4 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string70.base, #t~string70.offset, 1);call write~init~int(75, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 2 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string72.base, #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 1 + #t~string72.offset, 1); 573#L-1 havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~6, main_~tmp~9;havoc main_~retValue_acc~6;havoc main_~tmp~9; 574#L930 havoc valid_product_#res;havoc valid_product_~retValue_acc~11;havoc valid_product_~retValue_acc~11;valid_product_~retValue_acc~11 := 1;valid_product_#res := valid_product_~retValue_acc~11; 666#L938 main_#t~ret62 := valid_product_#res;main_~tmp~9 := main_#t~ret62;havoc main_#t~ret62; 565#L800 assume 0 != main_~tmp~9; 566#L774 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, 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; 613#L697-1 [2019-01-14 04:27:43,152 INFO L796 eck$LassoCheckResult]: Loop: 613#L697-1 assume !false; 616#L55 assume test_~splverifierCounter~0 < 4; 609#L56 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 610#L64 assume !(0 != test_~tmp~0); 621#L64-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 624#L74 assume !(0 != test_~tmp___0~0); 562#L74-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 570#L84 assume 0 != test_~tmp___2~0; 571#L90-2 assume !(0 != ~pumpRunning~0); 584#L125 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret5, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 585#L183 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret4, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 598#L157-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret24, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~9;havoc isHighWaterSensorDry_~retValue_acc~9; 629#L897-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~9 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~9; 669#L902-1 isHighWaterLevel_#t~ret24 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret24;havoc isHighWaterLevel_#t~ret24; 677#L302-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 670#L302-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 654#L308-1 processEnvironment__wrappee__methaneQuery_#t~ret4 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~1 := processEnvironment__wrappee__methaneQuery_#t~ret4;havoc processEnvironment__wrappee__methaneQuery_#t~ret4; 590#L161-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~1); 557#L132 havoc __utac_acc__Specification4_spec__1_#t~ret60, __utac_acc__Specification4_spec__1_#t~ret61, __utac_acc__Specification4_spec__1_~tmp~8, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~8;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~8;havoc getWaterLevel_~retValue_acc~8;getWaterLevel_~retValue_acc~8 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~8; 638#L889 __utac_acc__Specification4_spec__1_#t~ret60 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~8 := __utac_acc__Specification4_spec__1_#t~ret60;havoc __utac_acc__Specification4_spec__1_#t~ret60; 612#L697 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~8); 613#L697-1 [2019-01-14 04:27:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:27:43,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:43,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:43,551 INFO L82 PathProgramCache]: Analyzing trace with hash 790147600, now seen corresponding path program 1 times [2019-01-14 04:27:43,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:43,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:43,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:43,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:43,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:43,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1246218794, now seen corresponding path program 1 times [2019-01-14 04:27:43,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:43,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:43,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:43,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:43,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:44,853 WARN L181 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-14 04:27:45,179 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 04:28:08,141 WARN L181 SmtUtils]: Spent 22.95 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:28:22,811 WARN L181 SmtUtils]: Spent 14.67 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:28:22,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:28:22 BoogieIcfgContainer [2019-01-14 04:28:22,905 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:28:22,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:28:22,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:28:22,906 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:28:22,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:27:40" (3/4) ... [2019-01-14 04:28:22,911 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:28:22,978 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:28:22,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:28:22,979 INFO L168 Benchmark]: Toolchain (without parser) took 45145.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.1 MB). Free memory was 952.7 MB in the beginning and 915.2 MB in the end (delta: 37.5 MB). Peak memory consumption was 330.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:22,982 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-14 04:28:22,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:22,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.09 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-14 04:28:22,988 INFO L168 Benchmark]: Boogie Preprocessor took 51.72 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:22,994 INFO L168 Benchmark]: RCFGBuilder took 1446.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:22,995 INFO L168 Benchmark]: BuchiAutomizer took 42843.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 917.3 MB in the end (delta: 105.2 MB). Peak memory consumption was 410.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:22,996 INFO L168 Benchmark]: Witness Printer took 72.98 ms. Allocated memory is still 1.3 GB. Free memory was 917.3 MB in the beginning and 915.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:28:23,001 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 653.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -136.9 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.09 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. * Boogie Preprocessor took 51.72 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1446.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42843.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 917.3 MB in the end (delta: 105.2 MB). Peak memory consumption was 410.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.98 ms. Allocated memory is still 1.3 GB. Free memory was 917.3 MB in the beginning and 915.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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 160 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 41.6s. Construction of modules took 0.7s. 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 160 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 329 SDtfs, 654 SDslu, 59 SDs, 0 SdLazy, 38 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s 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: 54]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=-15, NULL=0, NULL=0, NULL=0, NULL=-11, NULL=0, NULL=0, NULL=-9, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cfeabe3=0, NULL=0, NULL=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@63cc1620=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71d348db=64, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@294cef44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ecbc34a=0, NULL=0, NULL=-18, NULL=-5, NULL=-22, NULL=-8, methaneLevelCritical=0, tmp___0=0, retValue_acc=1, NULL=0, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37fe9b20=0, NULL=-24, tmp___1=0, NULL=-3, cleanupTimeShifts=4, tmp=0, NULL=-19, tmp___0=0, NULL=-17, NULL=-14, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f65e713=0, \result=0, NULL=-16, NULL=-4, NULL=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=-21, \result=0, NULL=-20, NULL=-6, NULL=0, NULL=-23, NULL=0, NULL=0, NULL=0, \result=1, NULL=-10, NULL=0, tmp=1, retValue_acc=1, tmp=1, tmp___2=64, splverifierCounter=0, NULL=0, NULL=-12, NULL=-34, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c8235c8=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e614c70=0, head=0, tmp=0, NULL=-13, tmp=1, NULL=-7, NULL=0, NULL=0, NULL=-1, NULL=-2, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a9c75cc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L117] int pumpRunning = 0; [L118] int systemActive = 1; [L491] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L715] int cleanupTimeShifts = 4; [L814] int waterLevel = 1; [L815] int methaneLevelCritical = 0; [L791] int retValue_acc ; [L792] int tmp ; [L934] int retValue_acc ; [L937] retValue_acc = 1 [L938] return (retValue_acc); [L798] tmp = valid_product() [L800] COND TRUE \read(tmp) [L45] int splverifierCounter ; [L46] int tmp ; [L47] int tmp___0 ; [L48] int tmp___1 ; [L49] int tmp___2 ; [L52] splverifierCounter = 0 Loop: [L54] COND TRUE 1 [L56] COND TRUE splverifierCounter < 4 [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) [L125] COND FALSE !(\read(pumpRunning)) [L132] COND TRUE \read(systemActive) [L180] int tmp ; [L183] COND FALSE !(\read(pumpRunning)) [L154] int tmp ; [L157] COND TRUE ! pumpRunning [L294] int retValue_acc ; [L295] int tmp ; [L296] int tmp___0 ; [L894] int retValue_acc ; [L897] COND TRUE waterLevel < 2 [L898] retValue_acc = 1 [L899] return (retValue_acc); [L300] tmp = isHighWaterSensorDry() [L302] COND TRUE \read(tmp) [L303] tmp___0 = 0 [L307] retValue_acc = tmp___0 [L308] return (retValue_acc); [L159] tmp = isHighWaterLevel() [L161] COND FALSE !(\read(tmp)) [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...