./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product33_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product33_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 2bf5cdbd1397f8c2609b4d66a963cb35955afadc ................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:26:55,265 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:26:55,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:26:55,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:26:55,285 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:26:55,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:26:55,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:26:55,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:26:55,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:26:55,293 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:26:55,294 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:26:55,294 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:26:55,295 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:26:55,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:26:55,297 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:26:55,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:26:55,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:26:55,303 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:26:55,309 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:26:55,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:26:55,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:26:55,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:26:55,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:26:55,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:26:55,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:26:55,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:26:55,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:26:55,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:26:55,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:26:55,330 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:26:55,332 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:26:55,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:26:55,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:26:55,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:26:55,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:26:55,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:26:55,340 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:26:55,363 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:26:55,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:26:55,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:26:55,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:26:55,365 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:26:55,365 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:26:55,365 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:26:55,365 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:26:55,366 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:26:55,368 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:26:55,368 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:26:55,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:26:55,368 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:26:55,368 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:26:55,369 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:26:55,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:26:55,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:26:55,369 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:26:55,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:26:55,369 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:26:55,370 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:26:55,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:26:55,370 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:26:55,370 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:26:55,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:26:55,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:26:55,372 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:26:55,372 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:26:55,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:26:55,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:26:55,373 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:26:55,374 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:26:55,374 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 -> 2bf5cdbd1397f8c2609b4d66a963cb35955afadc [2019-01-14 04:26:55,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:26:55,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:26:55,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:26:55,457 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:26:55,458 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:26:55,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product33_false-unreach-call_false-termination.cil.c [2019-01-14 04:26:55,512 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3233f0e95/b841691c54724de1bf0e934e8357ecf2/FLAG1f1e1e60c [2019-01-14 04:26:56,044 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:26:56,046 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product33_false-unreach-call_false-termination.cil.c [2019-01-14 04:26:56,062 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3233f0e95/b841691c54724de1bf0e934e8357ecf2/FLAG1f1e1e60c [2019-01-14 04:26:56,292 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3233f0e95/b841691c54724de1bf0e934e8357ecf2 [2019-01-14 04:26:56,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:26:56,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:26:56,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:26:56,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:26:56,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:26:56,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:56,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2ce30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56, skipping insertion in model container [2019-01-14 04:26:56,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:56,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:26:56,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:26:56,693 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:26:56,710 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:26:56,943 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:26:56,984 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:26:56,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56 WrapperNode [2019-01-14 04:26:56,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:26:56,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:26:56,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:26:56,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:26:56,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:26:57,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:26:57,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:26:57,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:26:57,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... [2019-01-14 04:26:57,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:26:57,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:26:57,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:26:57,104 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:26:57,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:26:57,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:26:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:26:57,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:26:57,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:26:58,205 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:26:58,205 INFO L286 CfgBuilder]: Removed 96 assue(true) statements. [2019-01-14 04:26:58,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:26:58 BoogieIcfgContainer [2019-01-14 04:26:58,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:26:58,207 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:26:58,207 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:26:58,211 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:26:58,212 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:26:58,212 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:26:56" (1/3) ... [2019-01-14 04:26:58,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@560e694d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:26:58, skipping insertion in model container [2019-01-14 04:26:58,214 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:26:58,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:26:56" (2/3) ... [2019-01-14 04:26:58,214 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@560e694d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:26:58, skipping insertion in model container [2019-01-14 04:26:58,214 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:26:58,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:26:58" (3/3) ... [2019-01-14 04:26:58,216 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product33_false-unreach-call_false-termination.cil.c [2019-01-14 04:26:58,273 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:26:58,274 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:26:58,274 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:26:58,274 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:26:58,275 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:26:58,275 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:26:58,275 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:26:58,275 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:26:58,276 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:26:58,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-14 04:26:58,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-14 04:26:58,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:26:58,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:26:58,332 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:26:58,332 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:26:58,332 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:26:58,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2019-01-14 04:26:58,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2019-01-14 04:26:58,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:26:58,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:26:58,341 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:26:58,341 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:26:58,346 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string44.base, #t~string44.offset, 1);call write~init~int(77, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(101, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(116, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(104, #t~string44.base, 4 + #t~string44.offset, 1);call write~init~int(58, #t~string44.base, 5 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 6 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string46.base, #t~string46.offset, 1);call write~init~int(82, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(73, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(84, #t~string46.base, 3 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 4 + #t~string46.offset, 1);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(75, #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(2);call write~init~int(41, #t~string50.base, #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 1 + #t~string50.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 12#L-1true havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 48#L532true havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 69#L540true main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 71#L496true assume 0 != main_~tmp~3; 45#L469true havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 34#L882-1true [2019-01-14 04:26:58,346 INFO L796 eck$LassoCheckResult]: Loop: 34#L882-1true assume !false; 25#L556true assume test_~splverifierCounter~0 < 4; 42#L557true test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 63#L565true assume !(0 != test_~tmp~4); 49#L565-1true test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 46#L575true assume !(0 != test_~tmp___0~0); 28#L575-1true test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 13#L585true assume 0 != test_~tmp___2~0; 61#L591-2true assume !(0 != ~pumpRunning~0); 16#L720true assume !(0 != ~systemActive~0); 8#L727true havoc __utac_acc__Specification4_spec__1_#t~ret70, __utac_acc__Specification4_spec__1_#t~ret71, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 66#L690true __utac_acc__Specification4_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret70;havoc __utac_acc__Specification4_spec__1_#t~ret70; 31#L882true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 34#L882-1true [2019-01-14 04:26:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:26:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-14 04:26:58,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:26:58,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:26:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:26:58,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:26:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:26:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:26:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:26:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:26:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1681529854, now seen corresponding path program 1 times [2019-01-14 04:26:59,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:26:59,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:26:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:26:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:26:59,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:26:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:26:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:26:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:26:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 32749084, now seen corresponding path program 1 times [2019-01-14 04:26:59,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:26:59,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:26:59,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:26:59,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:26:59,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:26:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:26:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:26:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:26:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:26:59,626 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:26:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:26:59,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:26:59,769 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 6 states. [2019-01-14 04:27:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:00,025 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-01-14 04:27:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:27:00,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 103 transitions. [2019-01-14 04:27:00,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-14 04:27:00,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 96 transitions. [2019-01-14 04:27:00,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-01-14 04:27:00,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-01-14 04:27:00,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-01-14 04:27:00,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:00,040 INFO L706 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-14 04:27:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-01-14 04:27:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-14 04:27:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 04:27:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-01-14 04:27:00,070 INFO L729 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-14 04:27:00,071 INFO L609 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-01-14 04:27:00,071 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:27:00,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-01-14 04:27:00,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2019-01-14 04:27:00,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:00,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:00,074 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:00,074 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:00,075 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string44.base, #t~string44.offset, 1);call write~init~int(77, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(101, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(116, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(104, #t~string44.base, 4 + #t~string44.offset, 1);call write~init~int(58, #t~string44.base, 5 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 6 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string46.base, #t~string46.offset, 1);call write~init~int(82, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(73, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(84, #t~string46.base, 3 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 4 + #t~string46.offset, 1);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(75, #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(2);call write~init~int(41, #t~string50.base, #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 1 + #t~string50.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 185#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 186#L532 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 230#L540 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 235#L496 assume 0 != main_~tmp~3; 225#L469 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 212#L882-1 [2019-01-14 04:27:00,076 INFO L796 eck$LassoCheckResult]: Loop: 212#L882-1 assume !false; 203#L556 assume test_~splverifierCounter~0 < 4; 204#L557 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 223#L565 assume !(0 != test_~tmp~4); 197#L565-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 227#L575 assume !(0 != test_~tmp___0~0); 207#L575-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 187#L585 assume 0 != test_~tmp___2~0; 188#L591-2 assume !(0 != ~pumpRunning~0); 177#L720 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret51, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 190#L752 assume !(0 == ~pumpRunning~0); 178#L727 havoc __utac_acc__Specification4_spec__1_#t~ret70, __utac_acc__Specification4_spec__1_#t~ret71, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 179#L690 __utac_acc__Specification4_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret70;havoc __utac_acc__Specification4_spec__1_#t~ret70; 211#L882 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 212#L882-1 [2019-01-14 04:27:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-14 04:27:00,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:00,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:00,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:00,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:00,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash -619428453, now seen corresponding path program 1 times [2019-01-14 04:27:00,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:00,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:00,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:00,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:27:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:27:00,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:27:00,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:27:00,474 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:27:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:27:00,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:27:00,475 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-01-14 04:27:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:27:00,814 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2019-01-14 04:27:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:27:00,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 147 transitions. [2019-01-14 04:27:00,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2019-01-14 04:27:00,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 147 transitions. [2019-01-14 04:27:00,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2019-01-14 04:27:00,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2019-01-14 04:27:00,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 147 transitions. [2019-01-14 04:27:00,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:27:00,828 INFO L706 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-01-14 04:27:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 147 transitions. [2019-01-14 04:27:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-14 04:27:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 04:27:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2019-01-14 04:27:00,837 INFO L729 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-01-14 04:27:00,837 INFO L609 BuchiCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-01-14 04:27:00,837 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:27:00,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 147 transitions. [2019-01-14 04:27:00,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2019-01-14 04:27:00,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:27:00,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:27:00,841 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:27:00,841 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:27:00,841 INFO L794 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(13);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string44.base, #t~string44.offset, 1);call write~init~int(77, #t~string44.base, 1 + #t~string44.offset, 1);call write~init~int(101, #t~string44.base, 2 + #t~string44.offset, 1);call write~init~int(116, #t~string44.base, 3 + #t~string44.offset, 1);call write~init~int(104, #t~string44.base, 4 + #t~string44.offset, 1);call write~init~int(58, #t~string44.base, 5 + #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 6 + #t~string44.offset, 1);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string46.base, #t~string46.offset, 1);call write~init~int(82, #t~string46.base, 1 + #t~string46.offset, 1);call write~init~int(73, #t~string46.base, 2 + #t~string46.offset, 1);call write~init~int(84, #t~string46.base, 3 + #t~string46.offset, 1);call write~init~int(0, #t~string46.base, 4 + #t~string46.offset, 1);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(75, #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(2);call write~init~int(41, #t~string50.base, #t~string50.offset, 1);call write~init~int(0, #t~string50.base, 1 + #t~string50.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(13);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string56.base, #t~string56.offset, 1);call write~init~int(110, #t~string56.base, 1 + #t~string56.offset, 1);call write~init~int(0, #t~string56.base, 2 + #t~string56.offset, 1);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string58.base, #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 1 + #t~string58.offset, 1);call write~init~int(102, #t~string58.base, 2 + #t~string58.offset, 1);call write~init~int(0, #t~string58.base, 3 + #t~string58.offset, 1);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string60.base, #t~string60.offset, 1);call write~init~int(80, #t~string60.base, 1 + #t~string60.offset, 1);call write~init~int(117, #t~string60.base, 2 + #t~string60.offset, 1);call write~init~int(109, #t~string60.base, 3 + #t~string60.offset, 1);call write~init~int(112, #t~string60.base, 4 + #t~string60.offset, 1);call write~init~int(58, #t~string60.base, 5 + #t~string60.offset, 1);call write~init~int(0, #t~string60.base, 6 + #t~string60.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string62.base, #t~string62.offset, 1);call write~init~int(110, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 2 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string64.base, #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(102, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string66.base, #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 2 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string68.base, #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 1 + #t~string68.offset, 1); 369#L-1 havoc main_#res;havoc main_#t~ret35, main_~retValue_acc~3, main_~tmp~3;havoc main_~retValue_acc~3;havoc main_~tmp~3; 370#L532 havoc valid_product_#res;havoc valid_product_~retValue_acc~5;havoc valid_product_~retValue_acc~5;valid_product_~retValue_acc~5 := 1;valid_product_#res := valid_product_~retValue_acc~5; 419#L540 main_#t~ret35 := valid_product_#res;main_~tmp~3 := main_#t~ret35;havoc main_#t~ret35; 428#L496 assume 0 != main_~tmp~3; 413#L469 havoc test_#t~nondet37, test_#t~nondet38, test_#t~nondet39, test_#t~nondet40, test_~splverifierCounter~0, test_~tmp~4, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~4;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 414#L882-1 [2019-01-14 04:27:00,841 INFO L796 eck$LassoCheckResult]: Loop: 414#L882-1 assume !false; 388#L556 assume test_~splverifierCounter~0 < 4; 389#L557 test_~tmp~4 := test_#t~nondet37;havoc test_#t~nondet37; 447#L565 assume !(0 != test_~tmp~4); 442#L565-1 test_~tmp___0~0 := test_#t~nondet38;havoc test_#t~nondet38; 439#L575 assume !(0 != test_~tmp___0~0); 436#L575-1 test_~tmp___2~0 := test_#t~nondet39;havoc test_#t~nondet39; 371#L585 assume 0 != test_~tmp___2~0; 372#L591-2 assume !(0 != ~pumpRunning~0); 374#L720 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret51, processEnvironment_~tmp~5;havoc processEnvironment_~tmp~5; 375#L752 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret69, isHighWaterLevel_~retValue_acc~11, isHighWaterLevel_~tmp~6, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~11;havoc isHighWaterLevel_~tmp~6;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 376#L698 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 377#L703 isHighWaterLevel_#t~ret69 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~6 := isHighWaterLevel_#t~ret69;havoc isHighWaterLevel_#t~ret69; 417#L854 assume 0 != isHighWaterLevel_~tmp~6;isHighWaterLevel_~tmp___0~1 := 0; 418#L854-2 isHighWaterLevel_~retValue_acc~11 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~11; 400#L860 processEnvironment_#t~ret51 := isHighWaterLevel_#res;processEnvironment_~tmp~5 := processEnvironment_#t~ret51;havoc processEnvironment_#t~ret51; 401#L756 assume !(0 != processEnvironment_~tmp~5); 423#L727 havoc __utac_acc__Specification4_spec__1_#t~ret70, __utac_acc__Specification4_spec__1_#t~ret71, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~2;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~2;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 458#L690 __utac_acc__Specification4_spec__1_#t~ret70 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret70;havoc __utac_acc__Specification4_spec__1_#t~ret70; 456#L882 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 414#L882-1 [2019-01-14 04:27:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-14 04:27:00,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:00,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:00,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:00,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:00,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:01,087 INFO L82 PathProgramCache]: Analyzing trace with hash -22033881, now seen corresponding path program 1 times [2019-01-14 04:27:01,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:01,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:01,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:01,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:27:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:27:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash -7321907, now seen corresponding path program 1 times [2019-01-14 04:27:01,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:27:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:27:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:27:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:27:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:27:02,352 WARN L181 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-14 04:27:02,712 WARN L181 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 04:27:28,708 WARN L181 SmtUtils]: Spent 25.98 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-14 04:27:41,915 WARN L181 SmtUtils]: Spent 13.21 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-14 04:27:42,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:27:42 BoogieIcfgContainer [2019-01-14 04:27:42,016 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:27:42,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:27:42,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:27:42,017 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:27:42,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:26:58" (3/4) ... [2019-01-14 04:27:42,022 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 04:27:42,122 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 04:27:42,122 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:27:42,123 INFO L168 Benchmark]: Toolchain (without parser) took 45826.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -67.9 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:27:42,124 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:27:42,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:27:42,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.02 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-14 04:27:42,128 INFO L168 Benchmark]: Boogie Preprocessor took 36.87 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-14 04:27:42,134 INFO L168 Benchmark]: RCFGBuilder took 1102.67 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:27:42,136 INFO L168 Benchmark]: BuchiAutomizer took 43808.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 419.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:27:42,136 INFO L168 Benchmark]: Witness Printer took 105.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:27:42,143 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.18 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 686.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.02 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 36.87 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 1102.67 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 43808.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 419.8 MB. Max. memory is 11.5 GB. * Witness Printer took 105.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 43.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 42.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 109 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 209 SDtfs, 378 SDslu, 50 SDs, 0 SdLazy, 29 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 555]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9750} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7911b5fd=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=9750, NULL=-16, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4409f593=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@169ec742=0, NULL=-15, NULL=-13, methaneLevelCritical=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f135325=0, tmp=0, NULL=0, NULL=0, NULL=-23, tmp___1=0, NULL=-12, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b09ded0=0, NULL=-5, NULL=-10, cleanupTimeShifts=4, NULL=-14, NULL=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65bc8cd5=59, NULL=-17, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fecd9ca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@418a7a4f=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33cef8e=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=-20, \result=0, NULL=8254, NULL=0, tmp___0=0, NULL=0, NULL=9749, NULL=0, NULL=0, \result=1, NULL=-7, head=0, pumpRunning=0, retValue_acc=1, \result=0, NULL=-8, tmp=1, NULL=0, NULL=-22, NULL=0, retValue_acc=1, \result=1, NULL=-19, NULL=-4, retValue_acc=0, tmp=1, retValue_acc=1, tmp___2=59, NULL=-9, tmp=1, splverifierCounter=0, head=0, NULL=0, tmp=0, NULL=-3, NULL=-11, NULL=0, NULL=-2, NULL=0, NULL=0, NULL=-21, NULL=-18, NULL=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L615] int waterLevel = 1; [L616] int methaneLevelCritical = 0; [L712] int pumpRunning = 0; [L713] int systemActive = 1; [L487] int retValue_acc ; [L488] int tmp ; [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); [L494] tmp = valid_product() [L496] COND TRUE \read(tmp) [L546] int splverifierCounter ; [L547] int tmp ; [L548] int tmp___0 ; [L549] int tmp___1 ; [L550] int tmp___2 ; [L553] splverifierCounter = 0 Loop: [L555] COND TRUE 1 [L557] COND TRUE splverifierCounter < 4 [L563] tmp = __VERIFIER_nondet_int() [L565] COND FALSE !(\read(tmp)) [L573] tmp___0 = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp___0)) [L583] tmp___2 = __VERIFIER_nondet_int() [L585] COND TRUE \read(tmp___2) [L720] COND FALSE !(\read(pumpRunning)) [L727] COND TRUE \read(systemActive) [L749] int tmp ; [L752] COND TRUE ! pumpRunning [L846] int retValue_acc ; [L847] int tmp ; [L848] int tmp___0 ; [L695] int retValue_acc ; [L698] COND TRUE waterLevel < 2 [L699] retValue_acc = 1 [L700] return (retValue_acc); [L852] tmp = isHighWaterSensorDry() [L854] COND TRUE \read(tmp) [L855] tmp___0 = 0 [L859] retValue_acc = tmp___0 [L860] return (retValue_acc); [L754] tmp = isHighWaterLevel() [L756] COND FALSE !(\read(tmp)) [L875] int tmp ; [L876] int tmp___0 ; [L686] int retValue_acc ; [L689] retValue_acc = waterLevel [L690] return (retValue_acc); [L880] tmp = getWaterLevel() [L882] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...