./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_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 cd9d3373e3670d73493569b1c43b551709fc0f6c ........................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:47:45,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:47:45,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:47:45,392 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:47:45,392 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:47:45,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:47:45,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:47:45,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:47:45,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:47:45,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:47:45,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:47:45,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:47:45,403 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:47:45,404 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:47:45,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:47:45,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:47:45,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:47:45,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:47:45,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:47:45,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:47:45,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:47:45,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:47:45,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:47:45,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:47:45,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:47:45,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:47:45,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:47:45,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:47:45,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:47:45,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:47:45,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:47:45,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:47:45,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:47:45,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:47:45,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:47:45,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:47:45,430 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:47:45,447 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:47:45,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:47:45,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:47:45,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:47:45,449 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:47:45,450 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:47:45,450 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:47:45,450 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:47:45,450 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:47:45,450 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:47:45,450 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:47:45,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:47:45,451 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:47:45,451 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:47:45,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:47:45,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:47:45,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:47:45,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:47:45,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:47:45,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:47:45,454 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:47:45,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:47:45,454 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:47:45,454 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:47:45,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:47:45,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:47:45,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:47:45,455 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:47:45,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:47:45,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:47:45,456 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:47:45,458 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:47:45,459 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 -> cd9d3373e3670d73493569b1c43b551709fc0f6c [2019-01-01 23:47:45,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:47:45,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:47:45,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:47:45,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:47:45,525 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:47:45,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:45,598 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07746e2c7/17a63f2512704e78befa0c754abe52c2/FLAGe5e5003d6 [2019-01-01 23:47:46,198 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:47:46,199 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:46,212 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07746e2c7/17a63f2512704e78befa0c754abe52c2/FLAGe5e5003d6 [2019-01-01 23:47:46,449 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07746e2c7/17a63f2512704e78befa0c754abe52c2 [2019-01-01 23:47:46,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:47:46,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:47:46,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:46,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:47:46,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:47:46,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:46" (1/1) ... [2019-01-01 23:47:46,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69652895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:46, skipping insertion in model container [2019-01-01 23:47:46,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:46" (1/1) ... [2019-01-01 23:47:46,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:47:46,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:47:46,973 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:46,997 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:47:47,204 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:47,245 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:47:47,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47 WrapperNode [2019-01-01 23:47:47,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:47,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:47,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:47:47,247 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:47:47,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:47,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:47:47,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:47:47,331 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:47:47,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... [2019-01-01 23:47:47,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:47:47,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:47:47,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:47:47,408 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:47:47,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:47:47,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:47:47,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:47:47,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:47:47,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:47:48,738 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:47:48,738 INFO L280 CfgBuilder]: Removed 120 assue(true) statements. [2019-01-01 23:47:48,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:48 BoogieIcfgContainer [2019-01-01 23:47:48,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:47:48,740 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:47:48,740 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:47:48,743 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:47:48,744 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:48,744 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:47:46" (1/3) ... [2019-01-01 23:47:48,745 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f16855c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:48, skipping insertion in model container [2019-01-01 23:47:48,748 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:48,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:47" (2/3) ... [2019-01-01 23:47:48,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f16855c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:48, skipping insertion in model container [2019-01-01 23:47:48,750 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:48,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:48" (3/3) ... [2019-01-01 23:47:48,753 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:48,814 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:47:48,815 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:47:48,815 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:47:48,816 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:47:48,816 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:47:48,816 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:47:48,816 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:47:48,816 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:47:48,816 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:47:48,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-01 23:47:48,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-01 23:47:48,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:48,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:48,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:48,877 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:48,877 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:47:48,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-01 23:47:48,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 55 [2019-01-01 23:47:48,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:48,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:48,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:48,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:48,892 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~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); 18#L-1true havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~8, main_~tmp~8;havoc main_~retValue_acc~8;havoc main_~tmp~8; 11#L460true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 19#L468true main_#t~ret62 := valid_product_#res;main_~tmp~8 := main_#t~ret62;havoc main_#t~ret62; 67#L839true assume 0 != main_~tmp~8; 51#L816true havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 12#L51-1true [2019-01-01 23:47:48,893 INFO L796 eck$LassoCheckResult]: Loop: 12#L51-1true assume !false; 41#L490true assume test_~splverifierCounter~0 < 4; 58#L491true test_~tmp~4 := test_#t~nondet38;havoc test_#t~nondet38; 62#L499true assume !(0 != test_~tmp~4); 65#L499-1true test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 46#L509true assume !(0 != test_~tmp___0~1); 49#L509-1true test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 24#L519true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 35#L527-1true assume !(0 != ~pumpRunning~0); 83#L562true assume !(0 != ~systemActive~0); 74#L569true havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 13#L928true __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 14#L51true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 12#L51-1true [2019-01-01 23:47:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:47:48,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:48,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:48,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:48,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1671648180, now seen corresponding path program 1 times [2019-01-01 23:47:49,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:49,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:49,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:49,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:49,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:49,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:49,955 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:49,980 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-01-01 23:47:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:50,226 INFO L93 Difference]: Finished difference Result 166 states and 234 transitions. [2019-01-01 23:47:50,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:50,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 234 transitions. [2019-01-01 23:47:50,237 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 106 [2019-01-01 23:47:50,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 152 states and 219 transitions. [2019-01-01 23:47:50,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-01-01 23:47:50,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-01-01 23:47:50,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 219 transitions. [2019-01-01 23:47:50,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:50,251 INFO L705 BuchiCegarLoop]: Abstraction has 152 states and 219 transitions. [2019-01-01 23:47:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 219 transitions. [2019-01-01 23:47:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-01 23:47:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-01 23:47:50,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 216 transitions. [2019-01-01 23:47:50,301 INFO L728 BuchiCegarLoop]: Abstraction has 150 states and 216 transitions. [2019-01-01 23:47:50,301 INFO L608 BuchiCegarLoop]: Abstraction has 150 states and 216 transitions. [2019-01-01 23:47:50,301 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:47:50,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 216 transitions. [2019-01-01 23:47:50,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 104 [2019-01-01 23:47:50,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:50,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:50,306 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:50,306 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:50,307 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~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); 285#L-1 havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~8, main_~tmp~8;havoc main_~retValue_acc~8;havoc main_~tmp~8; 276#L460 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 277#L468 main_#t~ret62 := valid_product_#res;main_~tmp~8 := main_#t~ret62;havoc main_#t~ret62; 286#L839 assume 0 != main_~tmp~8; 327#L816 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 278#L51-1 [2019-01-01 23:47:50,307 INFO L796 eck$LassoCheckResult]: Loop: 278#L51-1 assume !false; 279#L490 assume test_~splverifierCounter~0 < 4; 314#L491 test_~tmp~4 := test_#t~nondet38;havoc test_#t~nondet38; 330#L499 assume !(0 != test_~tmp~4); 324#L499-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 320#L509 assume !(0 != test_~tmp___0~1); 321#L509-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 294#L519 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 295#L527-1 assume !(0 != ~pumpRunning~0); 300#L562 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 335#L594 assume !(0 == ~pumpRunning~0); 337#L569 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 280#L928 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 281#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 278#L51-1 [2019-01-01 23:47:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:50,307 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:47:50,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash -323255269, now seen corresponding path program 1 times [2019-01-01 23:47:50,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:50,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:50,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:50,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:50,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:50,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:50,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:50,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:50,706 INFO L87 Difference]: Start difference. First operand 150 states and 216 transitions. cyclomatic complexity: 69 Second operand 3 states. [2019-01-01 23:47:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:50,934 INFO L93 Difference]: Finished difference Result 233 states and 322 transitions. [2019-01-01 23:47:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:50,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 322 transitions. [2019-01-01 23:47:50,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 167 [2019-01-01 23:47:50,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 233 states and 322 transitions. [2019-01-01 23:47:50,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2019-01-01 23:47:50,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2019-01-01 23:47:50,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 322 transitions. [2019-01-01 23:47:50,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:50,960 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-01-01 23:47:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 322 transitions. [2019-01-01 23:47:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-01-01 23:47:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-01 23:47:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 322 transitions. [2019-01-01 23:47:50,995 INFO L728 BuchiCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-01-01 23:47:50,995 INFO L608 BuchiCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-01-01 23:47:50,995 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:47:50,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 322 transitions. [2019-01-01 23:47:50,997 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 167 [2019-01-01 23:47:50,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:50,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:51,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:51,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:51,000 INFO L794 eck$LassoCheckResult]: Stem: 719#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(30);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(9);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(21);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(30);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(9);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(21);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(30);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(9);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(25);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(13);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string48.base, #t~string48.offset, 1);call write~init~int(110, #t~string48.base, 1 + #t~string48.offset, 1);call write~init~int(0, #t~string48.base, 2 + #t~string48.offset, 1);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string50.base, #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 1 + #t~string50.offset, 1);call write~init~int(102, #t~string50.base, 2 + #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 3 + #t~string50.offset, 1);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string52.base, #t~string52.offset, 1);call write~init~int(80, #t~string52.base, 1 + #t~string52.offset, 1);call write~init~int(117, #t~string52.base, 2 + #t~string52.offset, 1);call write~init~int(109, #t~string52.base, 3 + #t~string52.offset, 1);call write~init~int(112, #t~string52.base, 4 + #t~string52.offset, 1);call write~init~int(58, #t~string52.base, 5 + #t~string52.offset, 1);call write~init~int(0, #t~string52.base, 6 + #t~string52.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string54.base, #t~string54.offset, 1);call write~init~int(110, #t~string54.base, 1 + #t~string54.offset, 1);call write~init~int(0, #t~string54.base, 2 + #t~string54.offset, 1);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(102, #t~string56.base, 2 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 3 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string58.base, #t~string58.offset, 1);call write~init~int(32, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 2 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string60.base, #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 1 + #t~string60.offset, 1);~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); 681#L-1 havoc main_#res;havoc main_#t~ret62, main_~retValue_acc~8, main_~tmp~8;havoc main_~retValue_acc~8;havoc main_~tmp~8; 667#L460 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 668#L468 main_#t~ret62 := valid_product_#res;main_~tmp~8 := main_#t~ret62;havoc main_#t~ret62; 682#L839 assume 0 != main_~tmp~8; 731#L816 havoc test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_#t~nondet41, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 732#L51-1 [2019-01-01 23:47:51,000 INFO L796 eck$LassoCheckResult]: Loop: 732#L51-1 assume !false; 796#L490 assume test_~splverifierCounter~0 < 4; 791#L491 test_~tmp~4 := test_#t~nondet38;havoc test_#t~nondet38; 792#L499 assume !(0 != test_~tmp~4); 786#L499-1 test_~tmp___0~1 := test_#t~nondet39;havoc test_#t~nondet39; 787#L509 assume !(0 != test_~tmp___0~1); 781#L509-1 test_~tmp___2~0 := test_#t~nondet40;havoc test_#t~nondet40; 782#L519 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 706#L527-1 assume !(0 != ~pumpRunning~0); 707#L562 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret42, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 816#L594 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret61, isHighWaterLevel_~retValue_acc~7, isHighWaterLevel_~tmp~7, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~7;havoc isHighWaterLevel_~tmp~7;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 686#L936 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 687#L941 isHighWaterLevel_#t~ret61 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~7 := isHighWaterLevel_#t~ret61;havoc isHighWaterLevel_#t~ret61; 815#L714 assume 0 != isHighWaterLevel_~tmp~7;isHighWaterLevel_~tmp___0~2 := 0; 720#L714-2 isHighWaterLevel_~retValue_acc~7 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~7; 721#L720 processEnvironment_#t~ret42 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret42;havoc processEnvironment_#t~ret42; 764#L598 assume !(0 != processEnvironment_~tmp~5); 765#L569 havoc __utac_acc__Specification4_spec__1_#t~ret0, __utac_acc__Specification4_spec__1_#t~ret1, __utac_acc__Specification4_spec__1_~tmp~0, __utac_acc__Specification4_spec__1_~tmp___0~0;havoc __utac_acc__Specification4_spec__1_~tmp~0;havoc __utac_acc__Specification4_spec__1_~tmp___0~0;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 820#L928 __utac_acc__Specification4_spec__1_#t~ret0 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~0 := __utac_acc__Specification4_spec__1_#t~ret0;havoc __utac_acc__Specification4_spec__1_#t~ret0; 819#L51 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0); 732#L51-1 [2019-01-01 23:47:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:47:51,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:51,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1551152025, now seen corresponding path program 1 times [2019-01-01 23:47:51,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:51,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:51,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:51,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:51,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1536440051, now seen corresponding path program 1 times [2019-01-01 23:47:51,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:51,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:52,671 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-01 23:47:52,816 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 23:48:18,887 WARN L181 SmtUtils]: Spent 26.04 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:48:31,377 WARN L181 SmtUtils]: Spent 12.49 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:48:31,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:48:31 BoogieIcfgContainer [2019-01-01 23:48:31,474 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:48:31,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:48:31,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:48:31,474 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:48:31,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:48" (3/4) ... [2019-01-01 23:48:31,483 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:48:31,646 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:48:31,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:48:31,648 INFO L168 Benchmark]: Toolchain (without parser) took 45194.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 951.4 MB in the beginning and 939.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 316.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:31,652 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:31,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:31,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.56 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-01 23:48:31,660 INFO L168 Benchmark]: Boogie Preprocessor took 76.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:31,661 INFO L168 Benchmark]: RCFGBuilder took 1331.89 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: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:31,661 INFO L168 Benchmark]: BuchiAutomizer took 42733.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 939.4 MB in the end (delta: 101.7 MB). Peak memory consumption was 418.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:31,662 INFO L168 Benchmark]: Witness Printer took 172.66 ms. Allocated memory is still 1.3 GB. Free memory was 939.4 MB in the beginning and 939.4 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 23:48:31,674 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.32 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 789.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.56 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. * Boogie Preprocessor took 76.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1331.89 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: 59.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42733.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 939.4 MB in the end (delta: 101.7 MB). Peak memory consumption was 418.8 MB. Max. memory is 11.5 GB. * Witness Printer took 172.66 ms. Allocated memory is still 1.3 GB. Free memory was 939.4 MB in the beginning and 939.4 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 3 locations. The remainder module has 233 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 41.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 233 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 230 SDtfs, 210 SDslu, 158 SDs, 0 SdLazy, 32 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 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: 489]: 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=0, NULL=0, NULL=0, retValue_acc=1, NULL=0, NULL=-10, NULL=0, retValue_acc=0, NULL=-22, NULL=-15, NULL=-23, methaneLevelCritical=0, tmp___0=0, tmp=0, NULL=0, NULL=-12, NULL=0, NULL=-24, retValue_acc=0, tmp___1=0, NULL=-8, NULL=-6, NULL=-4, tmp___0=0, cleanupTimeShifts=4, NULL=-21, NULL=-7, NULL=-11, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c3d69fc=0, NULL=-13, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20a4c707=0, NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@150db0ed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@173466bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@331e2aff=71, NULL=0, systemActive=1, waterLevel=1, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c50b07=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78276cb9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@47ff4e1c=0, NULL=-17, \result=0, NULL=0, NULL=0, NULL=0, NULL=-19, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, \result=0, NULL=-14, NULL=-2, NULL=-20, NULL=0, NULL=0, tmp=1, NULL=0, \result=1, NULL=-18, retValue_acc=1, tmp=1, NULL=-3, NULL=0, tmp=1, tmp___2=71, retValue_acc=1, NULL=-9, tmp___0=0, splverifierCounter=0, NULL=-16, head=0, tmp=0, NULL=-1, NULL=0, NULL=0, NULL=-5, NULL=0, NULL=0, NULL=-25, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7eb097b0=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L757] int cleanupTimeShifts = 4; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; [L830] int retValue_acc ; [L831] int tmp ; [L464] int retValue_acc ; [L467] retValue_acc = 1 [L468] return (retValue_acc); [L837] tmp = valid_product() [L839] COND TRUE \read(tmp) [L480] int splverifierCounter ; [L481] int tmp ; [L482] int tmp___0 ; [L483] int tmp___1 ; [L484] int tmp___2 ; [L487] splverifierCounter = 0 Loop: [L489] COND TRUE 1 [L491] COND TRUE splverifierCounter < 4 [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 [L562] COND FALSE !(\read(pumpRunning)) [L569] COND TRUE \read(systemActive) [L591] int tmp ; [L594] COND TRUE ! pumpRunning [L706] int retValue_acc ; [L707] int tmp ; [L708] int tmp___0 ; [L933] int retValue_acc ; [L936] COND TRUE waterLevel < 2 [L937] retValue_acc = 1 [L938] return (retValue_acc); [L712] tmp = isHighWaterSensorDry() [L714] COND TRUE \read(tmp) [L715] tmp___0 = 0 [L719] retValue_acc = tmp___0 [L720] return (retValue_acc); [L596] tmp = isHighWaterLevel() [L598] COND FALSE !(\read(tmp)) [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...