./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec1_product59_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec1_product59_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 216d00aaae39a5385dce6e868b43ee8cd776a043 .................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:31,500 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:36:31,502 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:36:31,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:36:31,520 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:36:31,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:36:31,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:36:31,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:36:31,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:36:31,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:36:31,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:36:31,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:36:31,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:36:31,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:36:31,537 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:36:31,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:36:31,541 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:36:31,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:36:31,553 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:36:31,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:36:31,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:36:31,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:36:31,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:36:31,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:36:31,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:36:31,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:36:31,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:36:31,571 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:36:31,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:36:31,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:36:31,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:36:31,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:36:31,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:36:31,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:36:31,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:36:31,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:36:31,583 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:36:31,615 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:36:31,615 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:36:31,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:36:31,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:36:31,617 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:36:31,617 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:36:31,617 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:36:31,618 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:36:31,621 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:36:31,621 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:36:31,621 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:36:31,621 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:36:31,621 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:36:31,621 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:36:31,622 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:36:31,622 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:36:31,622 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:36:31,622 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:36:31,622 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:36:31,622 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:36:31,623 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:36:31,623 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:36:31,623 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:36:31,623 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:36:31,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:36:31,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:36:31,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:36:31,624 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:36:31,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:36:31,624 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:36:31,624 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:36:31,627 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:36:31,627 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 -> 216d00aaae39a5385dce6e868b43ee8cd776a043 [2019-01-01 23:36:31,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:36:31,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:36:31,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:36:31,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:36:31,699 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:36:31,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec1_product59_true-unreach-call_false-termination.cil.c [2019-01-01 23:36:31,760 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a914cdc4/0323c6b27d7741b99e99a5de61cc22f5/FLAGbdf11587a [2019-01-01 23:36:32,264 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:36:32,267 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec1_product59_true-unreach-call_false-termination.cil.c [2019-01-01 23:36:32,283 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a914cdc4/0323c6b27d7741b99e99a5de61cc22f5/FLAGbdf11587a [2019-01-01 23:36:32,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a914cdc4/0323c6b27d7741b99e99a5de61cc22f5 [2019-01-01 23:36:32,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:36:32,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:36:32,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:36:32,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:36:32,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:36:32,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:36:32" (1/1) ... [2019-01-01 23:36:32,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3fa7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:32, skipping insertion in model container [2019-01-01 23:36:32,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:36:32" (1/1) ... [2019-01-01 23:36:32,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:36:32,662 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:36:33,097 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:36:33,117 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:36:33,301 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:36:33,347 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:36:33,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33 WrapperNode [2019-01-01 23:36:33,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:36:33,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:36:33,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:36:33,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:36:33,358 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:36:33" (1/1) ... [2019-01-01 23:36:33,390 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:36:33" (1/1) ... [2019-01-01 23:36:33,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:36:33,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:36:33,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:36:33,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:36:33,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (1/1) ... [2019-01-01 23:36:33,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:36:33,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:36:33,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:36:33,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:36:33,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (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:36:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:36:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:36:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:36:33,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:36:35,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:36:35,114 INFO L280 CfgBuilder]: Removed 196 assue(true) statements. [2019-01-01 23:36:35,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:36:35 BoogieIcfgContainer [2019-01-01 23:36:35,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:36:35,115 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:36:35,115 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:36:35,120 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:36:35,121 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:36:35,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:36:32" (1/3) ... [2019-01-01 23:36:35,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e963d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:36:35, skipping insertion in model container [2019-01-01 23:36:35,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:36:35,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:36:33" (2/3) ... [2019-01-01 23:36:35,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e963d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:36:35, skipping insertion in model container [2019-01-01 23:36:35,126 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:36:35,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:36:35" (3/3) ... [2019-01-01 23:36:35,128 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec1_product59_true-unreach-call_false-termination.cil.c [2019-01-01 23:36:35,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:36:35,195 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:36:35,195 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:36:35,195 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:36:35,196 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:36:35,196 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:36:35,196 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:36:35,196 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:36:35,196 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:36:35,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-01-01 23:36:35,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-01 23:36:35,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:36:35,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:36:35,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:36:35,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:36:35,265 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:36:35,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states. [2019-01-01 23:36:35,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2019-01-01 23:36:35,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:36:35,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:36:35,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:36:35,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:36:35,283 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(110, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 3 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string27.base, #t~string27.offset, 1);call write~init~int(80, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(117, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(109, #t~string27.base, 3 + #t~string27.offset, 1);call write~init~int(112, #t~string27.base, 4 + #t~string27.offset, 1);call write~init~int(58, #t~string27.base, 5 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 6 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(110, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string31.base, #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string33.base, #t~string33.offset, 1);call write~init~int(32, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 8#L-1true havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 31#L882true havoc valid_product_#res;havoc valid_product_~retValue_acc~12;havoc valid_product_~retValue_acc~12;valid_product_~retValue_acc~12 := 1;valid_product_#res := valid_product_~retValue_acc~12; 48#L890true main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 122#L977true assume 0 != main_~tmp~10; 15#L954true havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 29#L161-1true [2019-01-01 23:36:35,283 INFO L796 eck$LassoCheckResult]: Loop: 29#L161-1true assume !false; 43#L202true assume test_~splverifierCounter~0 < 4; 136#L203true test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 134#L211true assume !(0 != test_~tmp~1); 132#L211-1true test_~tmp___0~1 := test_#t~nondet13;havoc test_#t~nondet13; 42#L221true assume !(0 != test_~tmp___0~1); 41#L221-1true test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 104#L231true assume 0 != test_~tmp___2~0; 87#L237-1true assume !(0 != ~pumpRunning~0); 46#L268true assume !(0 != ~systemActive~0); 109#L275true havoc __utac_acc__Specification1_spec__1_#t~ret10, __utac_acc__Specification1_spec__1_#t~ret11, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 95#L91-2true __utac_acc__Specification1_spec__1_#t~ret10 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret10;havoc __utac_acc__Specification1_spec__1_#t~ret10; 32#L161true assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 29#L161-1true [2019-01-01 23:36:35,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:35,294 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:36:35,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:35,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:35,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1670509173, now seen corresponding path program 1 times [2019-01-01 23:36:36,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:36,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:36,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:36,280 INFO L82 PathProgramCache]: Analyzing trace with hash 43769765, now seen corresponding path program 1 times [2019-01-01 23:36:36,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:36,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:36,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:36,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:36,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:36:36,681 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:36:36,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:36:36,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:36:36,808 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 23:36:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:36:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:36:36,904 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 6 states. [2019-01-01 23:36:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:36:37,685 INFO L93 Difference]: Finished difference Result 312 states and 444 transitions. [2019-01-01 23:36:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:36:37,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 444 transitions. [2019-01-01 23:36:37,712 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 201 [2019-01-01 23:36:37,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 291 states and 423 transitions. [2019-01-01 23:36:37,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 291 [2019-01-01 23:36:37,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2019-01-01 23:36:37,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 291 states and 423 transitions. [2019-01-01 23:36:37,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:36:37,747 INFO L705 BuchiCegarLoop]: Abstraction has 291 states and 423 transitions. [2019-01-01 23:36:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states and 423 transitions. [2019-01-01 23:36:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 168. [2019-01-01 23:36:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-01 23:36:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-01-01 23:36:37,828 INFO L728 BuchiCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-01-01 23:36:37,828 INFO L608 BuchiCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-01-01 23:36:37,828 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:36:37,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 243 transitions. [2019-01-01 23:36:37,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2019-01-01 23:36:37,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:36:37,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:36:37,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:36:37,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:36:37,837 INFO L794 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(110, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 3 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string27.base, #t~string27.offset, 1);call write~init~int(80, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(117, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(109, #t~string27.base, 3 + #t~string27.offset, 1);call write~init~int(112, #t~string27.base, 4 + #t~string27.offset, 1);call write~init~int(58, #t~string27.base, 5 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 6 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(110, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string31.base, #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string33.base, #t~string33.offset, 1);call write~init~int(32, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 473#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 474#L882 havoc valid_product_#res;havoc valid_product_~retValue_acc~12;havoc valid_product_~retValue_acc~12;valid_product_~retValue_acc~12 := 1;valid_product_#res := valid_product_~retValue_acc~12; 510#L890 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 536#L977 assume 0 != main_~tmp~10; 487#L954 havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 488#L161-1 [2019-01-01 23:36:37,842 INFO L796 eck$LassoCheckResult]: Loop: 488#L161-1 assume !false; 509#L202 assume test_~splverifierCounter~0 < 4; 533#L203 test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 591#L211 assume !(0 != test_~tmp~1); 589#L211-1 test_~tmp___0~1 := test_#t~nondet13;havoc test_#t~nondet13; 531#L221 assume !(0 != test_~tmp___0~1); 529#L221-1 test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 530#L231 assume 0 != test_~tmp___2~0; 572#L237-1 assume !(0 != ~pumpRunning~0); 480#L268 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret17, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 513#L326 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret16, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 515#L300-1 assume !(0 == ~pumpRunning~0); 519#L275 havoc __utac_acc__Specification1_spec__1_#t~ret10, __utac_acc__Specification1_spec__1_#t~ret11, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 577#L91-2 __utac_acc__Specification1_spec__1_#t~ret10 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret10;havoc __utac_acc__Specification1_spec__1_#t~ret10; 511#L161 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 488#L161-1 [2019-01-01 23:36:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:36:37,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:37,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:37,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:37,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:37,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1972735892, now seen corresponding path program 1 times [2019-01-01 23:36:38,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:38,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:38,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:36:38,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:36:38,279 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:36:38,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:36:38,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:36:38,280 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:36:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:36:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:36:38,281 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. cyclomatic complexity: 78 Second operand 3 states. [2019-01-01 23:36:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:36:38,977 INFO L93 Difference]: Finished difference Result 207 states and 283 transitions. [2019-01-01 23:36:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:36:38,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 283 transitions. [2019-01-01 23:36:38,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 23:36:38,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 283 transitions. [2019-01-01 23:36:38,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2019-01-01 23:36:38,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2019-01-01 23:36:38,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 283 transitions. [2019-01-01 23:36:38,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:36:38,989 INFO L705 BuchiCegarLoop]: Abstraction has 207 states and 283 transitions. [2019-01-01 23:36:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 283 transitions. [2019-01-01 23:36:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-01 23:36:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-01 23:36:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 283 transitions. [2019-01-01 23:36:39,020 INFO L728 BuchiCegarLoop]: Abstraction has 207 states and 283 transitions. [2019-01-01 23:36:39,020 INFO L608 BuchiCegarLoop]: Abstraction has 207 states and 283 transitions. [2019-01-01 23:36:39,020 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:36:39,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 283 transitions. [2019-01-01 23:36:39,023 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 23:36:39,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:36:39,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:36:39,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:36:39,024 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, 1] [2019-01-01 23:36:39,025 INFO L794 eck$LassoCheckResult]: Stem: 975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13);call #t~string3.base, #t~string3.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string3.base, #t~string3.offset, 1);call write~init~int(77, #t~string3.base, 1 + #t~string3.offset, 1);call write~init~int(101, #t~string3.base, 2 + #t~string3.offset, 1);call write~init~int(116, #t~string3.base, 3 + #t~string3.offset, 1);call write~init~int(104, #t~string3.base, 4 + #t~string3.offset, 1);call write~init~int(58, #t~string3.base, 5 + #t~string3.offset, 1);call write~init~int(0, #t~string3.base, 6 + #t~string3.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string5.base, #t~string5.offset, 1);call write~init~int(82, #t~string5.base, 1 + #t~string5.offset, 1);call write~init~int(73, #t~string5.base, 2 + #t~string5.offset, 1);call write~init~int(84, #t~string5.base, 3 + #t~string5.offset, 1);call write~init~int(0, #t~string5.base, 4 + #t~string5.offset, 1);call #t~string7.base, #t~string7.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string7.base, #t~string7.offset, 1);call write~init~int(75, #t~string7.base, 1 + #t~string7.offset, 1);call write~init~int(0, #t~string7.base, 2 + #t~string7.offset, 1);call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string9.base, #t~string9.offset, 1);call write~init~int(0, #t~string9.base, 1 + #t~string9.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(13);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string23.base, #t~string23.offset, 1);call write~init~int(110, #t~string23.base, 1 + #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 2 + #t~string23.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string25.base, #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 1 + #t~string25.offset, 1);call write~init~int(102, #t~string25.base, 2 + #t~string25.offset, 1);call write~init~int(0, #t~string25.base, 3 + #t~string25.offset, 1);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string27.base, #t~string27.offset, 1);call write~init~int(80, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(117, #t~string27.base, 2 + #t~string27.offset, 1);call write~init~int(109, #t~string27.base, 3 + #t~string27.offset, 1);call write~init~int(112, #t~string27.base, 4 + #t~string27.offset, 1);call write~init~int(58, #t~string27.base, 5 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 6 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(110, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 2 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string31.base, #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(102, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 3 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string33.base, #t~string33.offset, 1);call write~init~int(32, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string35.base, #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 1 + #t~string35.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(21);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(21);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(25);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4; 853#L-1 havoc main_#res;havoc main_#t~ret74, main_~retValue_acc~13, main_~tmp~10;havoc main_~retValue_acc~13;havoc main_~tmp~10; 854#L882 havoc valid_product_#res;havoc valid_product_~retValue_acc~12;havoc valid_product_~retValue_acc~12;valid_product_~retValue_acc~12 := 1;valid_product_#res := valid_product_~retValue_acc~12; 889#L890 main_#t~ret74 := valid_product_#res;main_~tmp~10 := main_#t~ret74;havoc main_#t~ret74; 915#L977 assume 0 != main_~tmp~10; 867#L954 havoc test_#t~nondet12, test_#t~nondet13, test_#t~nondet14, test_#t~nondet15, test_~splverifierCounter~0, test_~tmp~1, test_~tmp___0~1, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~1;havoc test_~tmp___0~1;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 868#L161-1 [2019-01-01 23:36:39,025 INFO L796 eck$LassoCheckResult]: Loop: 868#L161-1 assume !false; 888#L202 assume test_~splverifierCounter~0 < 4; 910#L203 test_~tmp~1 := test_#t~nondet12;havoc test_#t~nondet12; 1046#L211 assume !(0 != test_~tmp~1); 1044#L211-1 test_~tmp___0~1 := test_#t~nondet13;havoc test_#t~nondet13; 1041#L221 assume !(0 != test_~tmp___0~1); 1037#L221-1 test_~tmp___2~0 := test_#t~nondet14;havoc test_#t~nondet14; 1032#L231 assume 0 != test_~tmp___2~0; 1030#L237-1 assume !(0 != ~pumpRunning~0); 914#L268 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret17, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 892#L326 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret16, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 893#L300-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret36, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 863#L131-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 864#L136-1 isHighWaterLevel_#t~ret36 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret36;havoc isHighWaterLevel_#t~ret36; 878#L446-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~2 := 0; 931#L446-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 917#L452-1 processEnvironment__wrappee__highWaterSensor_#t~ret16 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret16;havoc processEnvironment__wrappee__highWaterSensor_#t~ret16; 903#L304-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 897#L275 havoc __utac_acc__Specification1_spec__1_#t~ret10, __utac_acc__Specification1_spec__1_#t~ret11, __utac_acc__Specification1_spec__1_~tmp~0, __utac_acc__Specification1_spec__1_~tmp___0~0;havoc __utac_acc__Specification1_spec__1_~tmp~0;havoc __utac_acc__Specification1_spec__1_~tmp___0~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 1028#L91-2 __utac_acc__Specification1_spec__1_#t~ret10 := isMethaneLevelCritical_#res;__utac_acc__Specification1_spec__1_~tmp~0 := __utac_acc__Specification1_spec__1_#t~ret10;havoc __utac_acc__Specification1_spec__1_#t~ret10; 890#L161 assume !(0 != __utac_acc__Specification1_spec__1_~tmp~0); 868#L161-1 [2019-01-01 23:36:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:36:39,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:39,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:39,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1765215488, now seen corresponding path program 1 times [2019-01-01 23:36:39,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:39,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:39,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:36:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:36:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1309144294, now seen corresponding path program 1 times [2019-01-01 23:36:39,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:36:39,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:36:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:39,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:36:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:36:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:36:40,442 WARN L181 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 23:37:04,965 WARN L181 SmtUtils]: Spent 24.42 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:37:20,440 WARN L181 SmtUtils]: Spent 15.47 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:37:20,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:37:20 BoogieIcfgContainer [2019-01-01 23:37:20,542 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:37:20,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:37:20,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:37:20,542 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:37:20,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:36:35" (3/4) ... [2019-01-01 23:37:20,549 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:37:20,646 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:37:20,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:37:20,649 INFO L168 Benchmark]: Toolchain (without parser) took 48064.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 354.4 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -372.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:37:20,650 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:37:20,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:37:20,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:37:20,655 INFO L168 Benchmark]: Boogie Preprocessor took 50.64 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:37:20,656 INFO L168 Benchmark]: RCFGBuilder took 1621.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:37:20,657 INFO L168 Benchmark]: BuchiAutomizer took 45426.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -273.9 MB). Peak memory consumption was 402.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:37:20,657 INFO L168 Benchmark]: Witness Printer took 105.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:37:20,664 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.55 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. * Boogie Preprocessor took 50.64 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1621.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 45426.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -273.9 MB). Peak memory consumption was 402.9 MB. Max. memory is 11.5 GB. * Witness Printer took 105.68 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 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 207 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 43.5s. Construction of modules took 1.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 123 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 207 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 358 SDtfs, 863 SDslu, 860 SDs, 0 SdLazy, 73 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s 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: 201]: 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, retValue_acc=0, NULL=-14, NULL=0, NULL=-5, NULL=0, NULL=0, retValue_acc=1, NULL=-21, methaneLevelCritical=0, tmp___0=0, NULL=0, NULL=0, NULL=0, NULL=-20, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69e4f93b=0, NULL=-11, NULL=0, tmp___1=0, NULL=-13, retValue_acc=0, NULL=-12, tmp___0=0, cleanupTimeShifts=4, tmp=0, NULL=-10, NULL=-8, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c387aba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fbbdf30=0, tmp=1, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, NULL=-23, NULL=-2, \result=0, NULL=-22, NULL=0, NULL=0, NULL=0, \result=1, retValue_acc=0, head=0, pumpRunning=0, NULL=-17, \result=0, NULL=-7, NULL=-18, retValue_acc=1, NULL=0, NULL=0, NULL=0, NULL=-9, tmp=0, \result=1, NULL=-6, NULL=-16, NULL=-15, tmp___2=64, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7aeeb51f=0, tmp___0=0, splverifierCounter=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=0, NULL=-3, NULL=-25, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@85fecda=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30749c49=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@219f0492=64, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53fe7792=0, NULL=-19, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20bc3a0d=0, tmp=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a8ff8a0=0, NULL=-1, NULL=-4, NULL=0, NULL=-24} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L261] int pumpRunning = 0; [L262] int systemActive = 1; [L660] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L895] int cleanupTimeShifts = 4; [L968] int retValue_acc ; [L969] int tmp ; [L886] int retValue_acc ; [L889] retValue_acc = 1 [L890] return (retValue_acc); [L975] tmp = valid_product() [L977] COND TRUE \read(tmp) [L192] int splverifierCounter ; [L193] int tmp ; [L194] int tmp___0 ; [L195] int tmp___1 ; [L196] int tmp___2 ; [L199] splverifierCounter = 0 Loop: [L201] COND TRUE 1 [L203] COND TRUE splverifierCounter < 4 [L209] tmp = __VERIFIER_nondet_int() [L211] COND FALSE !(\read(tmp)) [L219] tmp___0 = __VERIFIER_nondet_int() [L221] COND FALSE !(\read(tmp___0)) [L229] tmp___2 = __VERIFIER_nondet_int() [L231] COND TRUE \read(tmp___2) [L268] COND FALSE !(\read(pumpRunning)) [L275] COND TRUE \read(systemActive) [L323] int tmp ; [L326] COND FALSE !(\read(pumpRunning)) [L297] int tmp ; [L300] COND TRUE ! pumpRunning [L438] int retValue_acc ; [L439] int tmp ; [L440] int tmp___0 ; [L128] int retValue_acc ; [L131] COND TRUE waterLevel < 2 [L132] retValue_acc = 1 [L133] return (retValue_acc); [L444] tmp = isHighWaterSensorDry() [L446] COND TRUE \read(tmp) [L447] tmp___0 = 0 [L451] retValue_acc = tmp___0 [L452] return (retValue_acc); [L302] tmp = isHighWaterLevel() [L304] COND FALSE !(\read(tmp)) [L154] int tmp ; [L155] int tmp___0 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); [L159] tmp = isMethaneLevelCritical() [L161] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...