./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product07_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_product07_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 ed47af17a01225db794df6404fe947f085302314 .......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:49:34,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:49:34,977 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:49:34,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:49:34,979 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:49:34,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:49:34,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:49:34,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:49:34,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:49:34,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:49:34,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:49:34,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:49:34,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:49:34,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:49:34,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:49:34,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:49:35,002 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:49:35,004 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:49:35,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:49:35,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:49:35,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:49:35,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:49:35,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:49:35,011 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:49:35,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:49:35,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:49:35,014 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:49:35,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:49:35,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:49:35,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:49:35,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:49:35,017 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:49:35,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:49:35,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:49:35,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:49:35,019 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:35,036 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:49:35,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:49:35,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:49:35,040 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:49:35,041 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:49:35,041 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:49:35,041 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:49:35,041 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:49:35,041 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:49:35,041 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:49:35,042 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:49:35,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:49:35,043 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:49:35,043 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:49:35,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:49:35,043 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:49:35,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:49:35,044 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:49:35,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:49:35,044 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:49:35,044 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:49:35,044 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:49:35,047 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:49:35,047 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:49:35,047 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:49:35,047 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:49:35,047 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:49:35,048 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:49:35,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:49:35,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:49:35,048 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:49:35,049 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:49:35,049 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 -> ed47af17a01225db794df6404fe947f085302314 [2019-01-01 23:49:35,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:49:35,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:49:35,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:49:35,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:49:35,110 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:49:35,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product07_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:35,178 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e714f88/e735186e5d8541be82b0ce043b4c5986/FLAGe7eb8eb68 [2019-01-01 23:49:35,690 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:49:35,691 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product07_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:35,704 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e714f88/e735186e5d8541be82b0ce043b4c5986/FLAGe7eb8eb68 [2019-01-01 23:49:35,995 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e714f88/e735186e5d8541be82b0ce043b4c5986 [2019-01-01 23:49:35,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:49:36,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:49:36,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:49:36,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:49:36,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:49:36,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:36,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22099427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:36, skipping insertion in model container [2019-01-01 23:49:36,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:49:35" (1/1) ... [2019-01-01 23:49:36,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:49:36,086 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:49:36,504 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:49:36,526 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:49:36,654 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:49:36,787 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:49:36,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:36 WrapperNode [2019-01-01 23:49:36,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:49:36,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:49:36,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:49:36,789 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:49:36,800 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:36" (1/1) ... [2019-01-01 23:49:36,829 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:36" (1/1) ... [2019-01-01 23:49:36,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:49:36,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:49:36,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:49:36,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:49:36,885 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:36" (1/1) ... [2019-01-01 23:49:36,885 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:36" (1/1) ... [2019-01-01 23:49:36,890 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:36" (1/1) ... [2019-01-01 23:49:36,890 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:36" (1/1) ... [2019-01-01 23:49:36,899 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:36" (1/1) ... [2019-01-01 23:49:36,907 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:36" (1/1) ... [2019-01-01 23:49:36,910 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:36" (1/1) ... [2019-01-01 23:49:36,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:49:36,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:49:36,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:49:36,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:49:36,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:36" (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:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:49:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:49:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:49:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:49:38,165 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:49:38,165 INFO L280 CfgBuilder]: Removed 114 assue(true) statements. [2019-01-01 23:49:38,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:38 BoogieIcfgContainer [2019-01-01 23:49:38,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:49:38,167 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:49:38,167 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:49:38,170 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:49:38,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:38,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:49:35" (1/3) ... [2019-01-01 23:49:38,173 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@111bd089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:49:38, skipping insertion in model container [2019-01-01 23:49:38,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:38,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:49:36" (2/3) ... [2019-01-01 23:49:38,174 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@111bd089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:49:38, skipping insertion in model container [2019-01-01 23:49:38,174 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:49:38,174 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:49:38" (3/3) ... [2019-01-01 23:49:38,176 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product07_true-unreach-call_false-termination.cil.c [2019-01-01 23:49:38,236 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:49:38,237 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:49:38,237 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:49:38,237 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:49:38,238 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:49:38,238 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:49:38,238 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:49:38,239 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:49:38,239 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:49:38,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:49:38,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:49:38,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:38,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:38,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:38,295 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:38,295 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:49:38,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:49:38,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:49:38,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:38,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:38,303 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:38,303 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:38,309 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~switchedOnBeforeTS~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(110, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 3 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string27.base, #t~string27.offset, 1);call write~init~int(80, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(117, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(109, #t~string27.base, 3 + #t~string27.offset, 1);call write~init~int(112, #t~string27.base, 4 + #t~string27.offset, 1);call write~init~int(58, #t~string27.base, 5 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 6 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(110, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string31.base, #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string33.base, #t~string33.offset, 1);call write~init~int(32, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~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~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 7#L533true havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 16#L541true main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 42#L132true assume 0 != main_~tmp~0; 34#L103true ~switchedOnBeforeTS~0 := 0; 41#L238true havoc test_#t~nondet14, test_#t~nondet15, test_#t~nondet16, test_#t~nondet17, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 24#L259-1true [2019-01-01 23:49:38,309 INFO L796 eck$LassoCheckResult]: Loop: 24#L259-1true assume !false; 31#L293true assume test_~splverifierCounter~0 < 4; 47#L294true test_~tmp~2 := test_#t~nondet14;havoc test_#t~nondet14; 77#L302true assume !(0 != test_~tmp~2); 75#L302-1true test_~tmp___0~1 := test_#t~nondet15;havoc test_#t~nondet15; 45#L312true assume !(0 != test_~tmp___0~1); 48#L312-1true test_~tmp___2~0 := test_#t~nondet16;havoc test_#t~nondet16; 33#L322true assume 0 != test_~tmp___2~0; 72#L328-1true havoc __utac_acc__Specification5_spec__2_#t~ret11;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 13#L446true __utac_acc__Specification5_spec__2_#t~ret11 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret11;havoc __utac_acc__Specification5_spec__2_#t~ret11; 26#L248true assume !(0 != ~pumpRunning~0); 65#L361true assume !(0 != ~systemActive~0); 76#L368true havoc __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_#t~ret13, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 71#L225true __utac_acc__Specification5_spec__3_#t~ret12 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret12;havoc __utac_acc__Specification5_spec__3_#t~ret12; 28#L259true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~1); 24#L259-1true [2019-01-01 23:49:38,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2019-01-01 23:49:38,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:38,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:38,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash -242168939, now seen corresponding path program 1 times [2019-01-01 23:49:39,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:39,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:39,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1691856271, now seen corresponding path program 1 times [2019-01-01 23:49:39,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:39,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:39,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:49:39,832 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:39,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:49:39,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:49:39,997 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 23:49:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:49:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:49:40,095 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 6 states. [2019-01-01 23:49:40,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:49:40,492 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2019-01-01 23:49:40,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:49:40,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 280 transitions. [2019-01-01 23:49:40,516 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 131 [2019-01-01 23:49:40,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 184 states and 259 transitions. [2019-01-01 23:49:40,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2019-01-01 23:49:40,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-01-01 23:49:40,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 259 transitions. [2019-01-01 23:49:40,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:49:40,546 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2019-01-01 23:49:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 259 transitions. [2019-01-01 23:49:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 119. [2019-01-01 23:49:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 23:49:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2019-01-01 23:49:40,612 INFO L728 BuchiCegarLoop]: Abstraction has 119 states and 167 transitions. [2019-01-01 23:49:40,612 INFO L608 BuchiCegarLoop]: Abstraction has 119 states and 167 transitions. [2019-01-01 23:49:40,612 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:49:40,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 167 transitions. [2019-01-01 23:49:40,619 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 84 [2019-01-01 23:49:40,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:40,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:40,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:40,620 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:40,620 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~switchedOnBeforeTS~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(110, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 3 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string27.base, #t~string27.offset, 1);call write~init~int(80, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(117, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(109, #t~string27.base, 3 + #t~string27.offset, 1);call write~init~int(112, #t~string27.base, 4 + #t~string27.offset, 1);call write~init~int(58, #t~string27.base, 5 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 6 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(110, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string31.base, #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string33.base, #t~string33.offset, 1);call write~init~int(32, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~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); 316#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 310#L533 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 311#L541 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 329#L132 assume 0 != main_~tmp~0; 348#L103 ~switchedOnBeforeTS~0 := 0; 349#L238 havoc test_#t~nondet14, test_#t~nondet15, test_#t~nondet16, test_#t~nondet17, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 306#L259-1 [2019-01-01 23:49:40,623 INFO L796 eck$LassoCheckResult]: Loop: 306#L259-1 assume !false; 338#L293 assume test_~splverifierCounter~0 < 4; 344#L294 test_~tmp~2 := test_#t~nondet14;havoc test_#t~nondet14; 356#L302 assume !(0 != test_~tmp~2); 309#L302-1 test_~tmp___0~1 := test_#t~nondet15;havoc test_#t~nondet15; 355#L312 assume !(0 != test_~tmp___0~1); 353#L312-1 test_~tmp___2~0 := test_#t~nondet16;havoc test_#t~nondet16; 345#L322 assume 0 != test_~tmp___2~0; 347#L328-1 havoc __utac_acc__Specification5_spec__2_#t~ret11;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 321#L446 __utac_acc__Specification5_spec__2_#t~ret11 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret11;havoc __utac_acc__Specification5_spec__2_#t~ret11; 322#L248 assume !(0 != ~pumpRunning~0); 340#L361 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret18, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 358#L393 assume !(0 != ~pumpRunning~0); 359#L368 havoc __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_#t~ret13, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 370#L225 __utac_acc__Specification5_spec__3_#t~ret12 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret12;havoc __utac_acc__Specification5_spec__3_#t~ret12; 342#L259 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~1); 306#L259-1 [2019-01-01 23:49:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:40,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2019-01-01 23:49:40,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:40,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:40,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1062169027, now seen corresponding path program 1 times [2019-01-01 23:49:41,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:41,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:41,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:41,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:49:41,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash 887408393, now seen corresponding path program 1 times [2019-01-01 23:49:41,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:41,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:49:41,451 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:41,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:49:41,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:49:41,719 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:49:42,146 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 23:49:42,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:49:42,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:49:42,166 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. cyclomatic complexity: 51 Second operand 5 states. [2019-01-01 23:49:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:49:42,780 INFO L93 Difference]: Finished difference Result 316 states and 435 transitions. [2019-01-01 23:49:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:49:42,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 435 transitions. [2019-01-01 23:49:42,790 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 162 [2019-01-01 23:49:42,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 435 transitions. [2019-01-01 23:49:42,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-01-01 23:49:42,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-01-01 23:49:42,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 435 transitions. [2019-01-01 23:49:42,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:49:42,808 INFO L705 BuchiCegarLoop]: Abstraction has 316 states and 435 transitions. [2019-01-01 23:49:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 435 transitions. [2019-01-01 23:49:42,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 231. [2019-01-01 23:49:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-01 23:49:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 313 transitions. [2019-01-01 23:49:42,844 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 313 transitions. [2019-01-01 23:49:42,846 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 313 transitions. [2019-01-01 23:49:42,846 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:49:42,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 313 transitions. [2019-01-01 23:49:42,848 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 162 [2019-01-01 23:49:42,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:49:42,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:49:42,852 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:49:42,852 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:42,854 INFO L794 eck$LassoCheckResult]: Stem: 810#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string2.base, #t~string2.offset := #Ultimate.allocOnStack(13);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string4.base, #t~string4.offset, 1);call write~init~int(77, #t~string4.base, 1 + #t~string4.offset, 1);call write~init~int(101, #t~string4.base, 2 + #t~string4.offset, 1);call write~init~int(116, #t~string4.base, 3 + #t~string4.offset, 1);call write~init~int(104, #t~string4.base, 4 + #t~string4.offset, 1);call write~init~int(58, #t~string4.base, 5 + #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 6 + #t~string4.offset, 1);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string6.base, #t~string6.offset, 1);call write~init~int(82, #t~string6.base, 1 + #t~string6.offset, 1);call write~init~int(73, #t~string6.base, 2 + #t~string6.offset, 1);call write~init~int(84, #t~string6.base, 3 + #t~string6.offset, 1);call write~init~int(0, #t~string6.base, 4 + #t~string6.offset, 1);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string8.base, #t~string8.offset, 1);call write~init~int(75, #t~string8.base, 1 + #t~string8.offset, 1);call write~init~int(0, #t~string8.base, 2 + #t~string8.offset, 1);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string10.base, #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 1 + #t~string10.offset, 1);~switchedOnBeforeTS~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(110, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 3 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string27.base, #t~string27.offset, 1);call write~init~int(80, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(117, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(109, #t~string27.base, 3 + #t~string27.offset, 1);call write~init~int(112, #t~string27.base, 4 + #t~string27.offset, 1);call write~init~int(58, #t~string27.base, 5 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 6 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(110, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string31.base, #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string33.base, #t~string33.offset, 1);call write~init~int(32, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~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); 769#L-1 havoc main_#res;havoc main_#t~ret0, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 761#L533 havoc valid_product_#res;havoc valid_product_~retValue_acc~6;havoc valid_product_~retValue_acc~6;valid_product_~retValue_acc~6 := 1;valid_product_#res := valid_product_~retValue_acc~6; 762#L541 main_#t~ret0 := valid_product_#res;main_~tmp~0 := main_#t~ret0;havoc main_#t~ret0; 781#L132 assume 0 != main_~tmp~0; 804#L103 ~switchedOnBeforeTS~0 := 0; 805#L238 havoc test_#t~nondet14, test_#t~nondet15, test_#t~nondet16, test_#t~nondet17, test_~splverifierCounter~0, test_~tmp~2, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~2;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 811#L259-1 [2019-01-01 23:49:42,854 INFO L796 eck$LassoCheckResult]: Loop: 811#L259-1 assume !false; 928#L293 assume test_~splverifierCounter~0 < 4; 813#L294 test_~tmp~2 := test_#t~nondet14;havoc test_#t~nondet14; 814#L302 assume !(0 != test_~tmp~2); 958#L302-1 test_~tmp___0~1 := test_#t~nondet15;havoc test_#t~nondet15; 957#L312 assume !(0 != test_~tmp___0~1); 953#L312-1 test_~tmp___2~0 := test_#t~nondet16;havoc test_#t~nondet16; 929#L322 assume 0 != test_~tmp___2~0; 836#L328-1 havoc __utac_acc__Specification5_spec__2_#t~ret11;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 951#L446 __utac_acc__Specification5_spec__2_#t~ret11 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret11;havoc __utac_acc__Specification5_spec__2_#t~ret11; 950#L248 assume !(0 != ~pumpRunning~0); 949#L361 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret18, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 905#L393 assume !(0 != ~pumpRunning~0); 935#L368 havoc __utac_acc__Specification5_spec__3_#t~ret12, __utac_acc__Specification5_spec__3_#t~ret13, __utac_acc__Specification5_spec__3_~tmp~1, __utac_acc__Specification5_spec__3_~tmp___0~0;havoc __utac_acc__Specification5_spec__3_~tmp~1;havoc __utac_acc__Specification5_spec__3_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~2;havoc getWaterLevel_~retValue_acc~2;getWaterLevel_~retValue_acc~2 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~2; 934#L225 __utac_acc__Specification5_spec__3_#t~ret12 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~1 := __utac_acc__Specification5_spec__3_#t~ret12;havoc __utac_acc__Specification5_spec__3_#t~ret12; 933#L259 assume 2 != __utac_acc__Specification5_spec__3_~tmp~1;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~4;havoc isPumpRunning_~retValue_acc~4;isPumpRunning_~retValue_acc~4 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~4; 932#L446-1 __utac_acc__Specification5_spec__3_#t~ret13 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~0 := __utac_acc__Specification5_spec__3_#t~ret13;havoc __utac_acc__Specification5_spec__3_#t~ret13; 930#L263 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~0); 811#L259-1 [2019-01-01 23:49:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2019-01-01 23:49:42,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:42,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:42,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:42,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:42,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1457795586, now seen corresponding path program 1 times [2019-01-01 23:49:43,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:43,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:43,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:49:43,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:49:43,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1899040316, now seen corresponding path program 1 times [2019-01-01 23:49:43,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:49:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:49:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:43,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:49:43,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:49:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:49:44,682 WARN L181 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-01 23:49:45,104 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 23:50:14,828 WARN L181 SmtUtils]: Spent 29.71 s on a formula simplification. DAG size of input: 455 DAG size of output: 453 [2019-01-01 23:50:29,274 WARN L181 SmtUtils]: Spent 14.44 s on a formula simplification that was a NOOP. DAG size: 451 [2019-01-01 23:50:29,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:50:29 BoogieIcfgContainer [2019-01-01 23:50:29,360 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:50:29,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:50:29,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:50:29,361 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:50:29,363 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:38" (3/4) ... [2019-01-01 23:50:29,367 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:50:29,481 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:50:29,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:50:29,482 INFO L168 Benchmark]: Toolchain (without parser) took 53482.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -228.6 MB). Peak memory consumption was 107.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:29,484 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:29,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:29,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:29,488 INFO L168 Benchmark]: Boogie Preprocessor took 44.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:50:29,491 INFO L168 Benchmark]: RCFGBuilder took 1251.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:29,496 INFO L168 Benchmark]: BuchiAutomizer took 51193.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.8 MB). Peak memory consumption was 431.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:29,496 INFO L168 Benchmark]: Witness Printer took 120.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:50:29,505 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 786.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 43.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1251.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.4 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 51193.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 211.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.8 MB). Peak memory consumption was 431.6 MB. Max. memory is 11.5 GB. * Witness Printer took 120.60 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 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 231 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 51.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 49.7s. Construction of modules took 0.6s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 150 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 231 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 256 SDtfs, 685 SDslu, 870 SDs, 0 SdLazy, 109 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 292]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1793} State at position 1 is {NULL=0, NULL=0, NULL=-1, NULL=-4, retValue_acc=0, NULL=1793, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73ce13da=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2290fbe0=0, NULL=-18, NULL=-15, methaneLevelCritical=0, NULL=-9, tmp=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f538c66=0, NULL=0, NULL=0, NULL=-5, NULL=0, NULL=-13, NULL=0, NULL=-8, tmp=1, tmp___1=0, NULL=-2, NULL=-10, NULL=0, NULL=0, NULL=0, NULL=0, cleanupTimeShifts=4, switchedOnBeforeTS=0, NULL=-6, NULL=-23, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=1792, \result=1, NULL=-24, NULL=0, retValue_acc=1, NULL=-21, NULL=0, NULL=0, NULL=0, NULL=0, NULL=-12, tmp___0=0, \result=1, head=0, pumpRunning=0, tmp=1, NULL=-19, \result=0, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11403a8d=0, NULL=-14, NULL=0, NULL=0, NULL=-3, retValue_acc=1, NULL=-20, tmp___2=59, tmp___0=0, splverifierCounter=0, NULL=0, NULL=-7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f07c32b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3165e05a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@44f587ff=59, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2aa65f44=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a9d8804=0, NULL=-22, tmp=0, head=0, NULL=-11, NULL=0, NULL=-17, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L40] int cleanupTimeShifts = 4; [L150] int waterLevel = 1; [L151] int methaneLevelCritical = 0; [L232] int switchedOnBeforeTS ; [L351] int pumpRunning = 0; [L352] int systemActive = 1; [L715] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L123] int retValue_acc ; [L124] int tmp ; [L537] int retValue_acc ; [L540] retValue_acc = 1 [L541] return (retValue_acc); [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) [L237] switchedOnBeforeTS = 0 [L283] int splverifierCounter ; [L284] int tmp ; [L285] int tmp___0 ; [L286] int tmp___1 ; [L287] int tmp___2 ; [L290] splverifierCounter = 0 Loop: [L292] COND TRUE 1 [L294] COND TRUE splverifierCounter < 4 [L300] tmp = __VERIFIER_nondet_int() [L302] COND FALSE !(\read(tmp)) [L310] tmp___0 = __VERIFIER_nondet_int() [L312] COND FALSE !(\read(tmp___0)) [L320] tmp___2 = __VERIFIER_nondet_int() [L322] COND TRUE \read(tmp___2) [L442] int retValue_acc ; [L445] retValue_acc = pumpRunning [L446] return (retValue_acc); [L246] switchedOnBeforeTS = isPumpRunning() [L361] COND FALSE !(\read(pumpRunning)) [L368] COND TRUE \read(systemActive) [L390] int tmp ; [L393] COND FALSE !(\read(pumpRunning)) [L252] int tmp ; [L253] int tmp___0 ; [L221] int retValue_acc ; [L224] retValue_acc = waterLevel [L225] return (retValue_acc); [L257] tmp = getWaterLevel() [L259] COND TRUE tmp != 2 [L442] int retValue_acc ; [L445] retValue_acc = pumpRunning [L446] return (retValue_acc); [L261] tmp___0 = isPumpRunning() [L263] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...