./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_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 cad5f4eca7a20f7ca6dddfa07fda554bac28f7be ................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:47:11,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:47:11,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:47:11,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:47:11,082 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:47:11,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:47:11,085 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:47:11,087 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:47:11,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:47:11,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:47:11,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:47:11,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:47:11,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:47:11,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:47:11,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:47:11,096 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:47:11,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:47:11,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:47:11,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:47:11,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:47:11,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:47:11,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:47:11,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:47:11,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:47:11,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:47:11,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:47:11,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:47:11,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:47:11,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:47:11,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:47:11,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:47:11,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:47:11,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:47:11,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:47:11,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:47:11,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:47:11,122 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:47:11,150 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:47:11,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:47:11,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:47:11,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:47:11,153 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:47:11,153 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:47:11,153 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:47:11,153 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:47:11,153 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:47:11,154 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:47:11,154 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:47:11,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:47:11,154 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:47:11,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:47:11,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:47:11,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:47:11,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:47:11,156 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:47:11,156 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:47:11,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:47:11,157 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:47:11,157 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:47:11,157 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:47:11,157 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:47:11,157 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:47:11,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:47:11,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:47:11,159 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:47:11,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:47:11,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:47:11,159 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:47:11,160 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:47:11,161 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 -> cad5f4eca7a20f7ca6dddfa07fda554bac28f7be [2019-01-01 23:47:11,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:47:11,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:47:11,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:47:11,226 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:47:11,227 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:47:11,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:11,286 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17f0d60c/fc93676cb2a343eca7f502a3299a70b0/FLAGd929fd5c2 [2019-01-01 23:47:11,792 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:47:11,796 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product35_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:11,817 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17f0d60c/fc93676cb2a343eca7f502a3299a70b0/FLAGd929fd5c2 [2019-01-01 23:47:12,083 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d17f0d60c/fc93676cb2a343eca7f502a3299a70b0 [2019-01-01 23:47:12,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:47:12,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:47:12,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:12,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:47:12,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:47:12,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9e942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12, skipping insertion in model container [2019-01-01 23:47:12,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:47:12,167 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:47:12,570 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:12,601 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:47:12,784 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:47:12,830 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:47:12,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12 WrapperNode [2019-01-01 23:47:12,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:47:12,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:12,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:47:12,832 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:47:12,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:47:12,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:47:12,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:47:12,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:47:12,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... [2019-01-01 23:47:12,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:47:12,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:47:12,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:47:12,957 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:47:12,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:47:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:47:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:47:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:47:13,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:47:14,233 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:47:14,233 INFO L280 CfgBuilder]: Removed 100 assue(true) statements. [2019-01-01 23:47:14,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:14 BoogieIcfgContainer [2019-01-01 23:47:14,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:47:14,234 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:47:14,234 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:47:14,237 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:47:14,238 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:14,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:47:12" (1/3) ... [2019-01-01 23:47:14,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@258d2334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:14, skipping insertion in model container [2019-01-01 23:47:14,240 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:14,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:47:12" (2/3) ... [2019-01-01 23:47:14,241 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@258d2334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:47:14, skipping insertion in model container [2019-01-01 23:47:14,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:47:14,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:14" (3/3) ... [2019-01-01 23:47:14,243 INFO L375 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product35_false-unreach-call_false-termination.cil.c [2019-01-01 23:47:14,298 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:47:14,298 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:47:14,299 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:47:14,299 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:47:14,299 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:47:14,299 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:47:14,299 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:47:14,299 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:47:14,300 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:47:14,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:47:14,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:47:14,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:14,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:14,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:14,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:14,358 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:47:14,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states. [2019-01-01 23:47:14,365 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2019-01-01 23:47:14,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:14,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:14,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:14,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:14,372 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 15#L-1true havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 13#L811true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 19#L819true main_#t~ret25 := valid_product_#res;main_~tmp~4 := main_#t~ret25;havoc main_#t~ret25; 55#L400true assume 0 != main_~tmp~4; 44#L374true havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 63#L123-1true [2019-01-01 23:47:14,373 INFO L796 eck$LassoCheckResult]: Loop: 63#L123-1true assume !false; 53#L56true assume test_~splverifierCounter~0 < 4; 78#L57true test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 21#L65true assume !(0 != test_~tmp~0); 20#L65-1true test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 73#L75true assume !(0 != test_~tmp___0~0); 72#L75-1true test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 48#L85true assume 0 != test_~tmp___2~0; 5#L91-1true assume !(0 != ~pumpRunning~0); 43#L155true assume !(0 != ~systemActive~0); 52#L162true havoc __utac_acc__Specification4_spec__1_#t~ret4, __utac_acc__Specification4_spec__1_#t~ret5, __utac_acc__Specification4_spec__1_~tmp~1, __utac_acc__Specification4_spec__1_~tmp___0~1;havoc __utac_acc__Specification4_spec__1_~tmp~1;havoc __utac_acc__Specification4_spec__1_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 6#L899true __utac_acc__Specification4_spec__1_#t~ret4 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~1 := __utac_acc__Specification4_spec__1_#t~ret4;havoc __utac_acc__Specification4_spec__1_#t~ret4; 66#L123true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~1); 63#L123-1true [2019-01-01 23:47:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2019-01-01 23:47:14,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:14,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:14,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:14,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:14,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:15,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1672941109, now seen corresponding path program 1 times [2019-01-01 23:47:15,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:15,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:15,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash 41337829, now seen corresponding path program 1 times [2019-01-01 23:47:15,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:15,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:15,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:15,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:15,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:15,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:47:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 23:47:15,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 23:47:15,764 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 6 states. [2019-01-01 23:47:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:16,148 INFO L93 Difference]: Finished difference Result 198 states and 276 transitions. [2019-01-01 23:47:16,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 23:47:16,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 276 transitions. [2019-01-01 23:47:16,172 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 125 [2019-01-01 23:47:16,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 177 states and 255 transitions. [2019-01-01 23:47:16,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2019-01-01 23:47:16,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2019-01-01 23:47:16,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 255 transitions. [2019-01-01 23:47:16,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:16,196 INFO L705 BuchiCegarLoop]: Abstraction has 177 states and 255 transitions. [2019-01-01 23:47:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 255 transitions. [2019-01-01 23:47:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 111. [2019-01-01 23:47:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 23:47:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-01-01 23:47:16,252 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-01-01 23:47:16,252 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-01-01 23:47:16,253 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:47:16,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 159 transitions. [2019-01-01 23:47:16,263 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2019-01-01 23:47:16,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:16,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:16,264 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:16,264 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:16,264 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 314#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 311#L811 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 312#L819 main_#t~ret25 := valid_product_#res;main_~tmp~4 := main_#t~ret25;havoc main_#t~ret25; 319#L400 assume 0 != main_~tmp~4; 349#L374 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 316#L123-1 [2019-01-01 23:47:16,265 INFO L796 eck$LassoCheckResult]: Loop: 316#L123-1 assume !false; 353#L56 assume test_~splverifierCounter~0 < 4; 354#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 322#L65 assume !(0 != test_~tmp~0); 320#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 321#L75 assume !(0 != test_~tmp___0~0); 361#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 352#L85 assume 0 != test_~tmp___2~0; 295#L91-1 assume !(0 != ~pumpRunning~0); 297#L155 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret6, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 333#L187 assume !(0 == ~pumpRunning~0); 335#L162 havoc __utac_acc__Specification4_spec__1_#t~ret4, __utac_acc__Specification4_spec__1_#t~ret5, __utac_acc__Specification4_spec__1_~tmp~1, __utac_acc__Specification4_spec__1_~tmp___0~1;havoc __utac_acc__Specification4_spec__1_~tmp~1;havoc __utac_acc__Specification4_spec__1_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 298#L899 __utac_acc__Specification4_spec__1_#t~ret4 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~1 := __utac_acc__Specification4_spec__1_#t~ret4;havoc __utac_acc__Specification4_spec__1_#t~ret4; 299#L123 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~1); 316#L123-1 [2019-01-01 23:47:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2019-01-01 23:47:16,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:16,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:16,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:16,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:16,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash -353177349, now seen corresponding path program 1 times [2019-01-01 23:47:16,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:16,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:16,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:16,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:16,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:47:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:47:16,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:47:16,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:47:16,669 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:47:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:47:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:47:16,671 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. cyclomatic complexity: 51 Second operand 3 states. [2019-01-01 23:47:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:47:17,162 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2019-01-01 23:47:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 23:47:17,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 202 transitions. [2019-01-01 23:47:17,166 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2019-01-01 23:47:17,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 202 transitions. [2019-01-01 23:47:17,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2019-01-01 23:47:17,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2019-01-01 23:47:17,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 202 transitions. [2019-01-01 23:47:17,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:47:17,171 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 202 transitions. [2019-01-01 23:47:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 202 transitions. [2019-01-01 23:47:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-01-01 23:47:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-01 23:47:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2019-01-01 23:47:17,183 INFO L728 BuchiCegarLoop]: Abstraction has 150 states and 202 transitions. [2019-01-01 23:47:17,184 INFO L608 BuchiCegarLoop]: Abstraction has 150 states and 202 transitions. [2019-01-01 23:47:17,184 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:47:17,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 202 transitions. [2019-01-01 23:47:17,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2019-01-01 23:47:17,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:47:17,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:47:17,188 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:47:17,188 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:47:17,189 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~pumpRunning~0 := 0;~systemActive~0 := 1;call #t~string9.base, #t~string9.offset := #Ultimate.allocOnStack(13);call #t~string11.base, #t~string11.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string11.base, #t~string11.offset, 1);call write~init~int(110, #t~string11.base, 1 + #t~string11.offset, 1);call write~init~int(0, #t~string11.base, 2 + #t~string11.offset, 1);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string13.base, #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(102, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 3 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(80, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(117, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(109, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(112, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(110, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(102, #t~string19.base, 2 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 3 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(32, #t~string21.base, 1 + #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 2 + #t~string21.offset, 1);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string23.base, #t~string23.offset, 1);call write~init~int(0, #t~string23.base, 1 + #t~string23.offset, 1);~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0;call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(21);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(30);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(9);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(25);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(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(13);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string65.base, #t~string65.offset, 1);call write~init~int(77, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(101, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(104, #t~string65.base, 4 + #t~string65.offset, 1);call write~init~int(58, #t~string65.base, 5 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 6 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string67.base, #t~string67.offset, 1);call write~init~int(82, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(73, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(84, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string69.base, #t~string69.offset, 1);call write~init~int(75, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string71.base, #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 1 + #t~string71.offset, 1); 581#L-1 havoc main_#res;havoc main_#t~ret25, main_~retValue_acc~3, main_~tmp~4;havoc main_~retValue_acc~3;havoc main_~tmp~4; 578#L811 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 579#L819 main_#t~ret25 := valid_product_#res;main_~tmp~4 := main_#t~ret25;havoc main_#t~ret25; 590#L400 assume 0 != main_~tmp~4; 622#L374 havoc test_#t~nondet0, test_#t~nondet1, test_#t~nondet2, test_#t~nondet3, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 623#L123-1 [2019-01-01 23:47:17,190 INFO L796 eck$LassoCheckResult]: Loop: 623#L123-1 assume !false; 683#L56 assume test_~splverifierCounter~0 < 4; 644#L57 test_~tmp~0 := test_#t~nondet0;havoc test_#t~nondet0; 591#L65 assume !(0 != test_~tmp~0); 588#L65-1 test_~tmp___0~0 := test_#t~nondet1;havoc test_#t~nondet1; 589#L75 assume !(0 != test_~tmp___0~0); 642#L75-1 test_~tmp___2~0 := test_#t~nondet2;havoc test_#t~nondet2; 628#L85 assume 0 != test_~tmp___2~0; 567#L91-1 assume !(0 != ~pumpRunning~0); 621#L155 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret6, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 600#L187 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret24, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~2;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~2;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~11;havoc isHighWaterSensorDry_~retValue_acc~11; 601#L907 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~11; 607#L912 isHighWaterLevel_#t~ret24 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret24;havoc isHighWaterLevel_#t~ret24; 617#L289 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~2 := 0; 612#L289-2 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~2;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 613#L295 processEnvironment_#t~ret6 := isHighWaterLevel_#res;processEnvironment_~tmp~2 := processEnvironment_#t~ret6;havoc processEnvironment_#t~ret6; 625#L191 assume !(0 != processEnvironment_~tmp~2); 627#L162 havoc __utac_acc__Specification4_spec__1_#t~ret4, __utac_acc__Specification4_spec__1_#t~ret5, __utac_acc__Specification4_spec__1_~tmp~1, __utac_acc__Specification4_spec__1_~tmp___0~1;havoc __utac_acc__Specification4_spec__1_~tmp~1;havoc __utac_acc__Specification4_spec__1_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~10;havoc getWaterLevel_~retValue_acc~10;getWaterLevel_~retValue_acc~10 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~10; 631#L899 __utac_acc__Specification4_spec__1_#t~ret4 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~1 := __utac_acc__Specification4_spec__1_#t~ret4;havoc __utac_acc__Specification4_spec__1_#t~ret4; 685#L123 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~1); 623#L123-1 [2019-01-01 23:47:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2019-01-01 23:47:17,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash -539551513, now seen corresponding path program 1 times [2019-01-01 23:47:17,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:17,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:17,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:47:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:47:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -524839539, now seen corresponding path program 1 times [2019-01-01 23:47:17,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:47:17,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:47:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:17,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:47:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:47:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:47:18,933 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-01-01 23:47:19,355 WARN L181 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 23:47:47,518 WARN L181 SmtUtils]: Spent 28.16 s on a formula simplification. DAG size of input: 451 DAG size of output: 449 [2019-01-01 23:48:01,662 WARN L181 SmtUtils]: Spent 14.14 s on a formula simplification that was a NOOP. DAG size: 449 [2019-01-01 23:48:01,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:48:01 BoogieIcfgContainer [2019-01-01 23:48:01,779 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:48:01,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:48:01,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:48:01,780 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:48:01,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:47:14" (3/4) ... [2019-01-01 23:48:01,786 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:48:01,880 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:48:01,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:48:01,881 INFO L168 Benchmark]: Toolchain (without parser) took 49791.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 952.7 MB in the beginning and 883.3 MB in the end (delta: 69.4 MB). Peak memory consumption was 403.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,882 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:48:01,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.85 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,887 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 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:48:01,893 INFO L168 Benchmark]: RCFGBuilder took 1276.61 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.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,893 INFO L168 Benchmark]: BuchiAutomizer took 47545.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 894.9 MB in the end (delta: 179.4 MB). Peak memory consumption was 425.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,894 INFO L168 Benchmark]: Witness Printer took 99.99 ms. Allocated memory is still 1.4 GB. Free memory was 894.9 MB in the beginning and 883.3 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:48:01,901 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 739.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.85 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.16 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 1276.61 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.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 47545.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 894.9 MB in the end (delta: 179.4 MB). Peak memory consumption was 425.6 MB. Max. memory is 11.5 GB. * Witness Printer took 99.99 ms. Allocated memory is still 1.4 GB. Free memory was 894.9 MB in the beginning and 883.3 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 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 150 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 47.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 46.2s. Construction of modules took 0.7s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 66 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 150 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 214 SDtfs, 476 SDslu, 590 SDs, 0 SdLazy, 64 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 55]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=711} State at position 1 is {NULL=-2, NULL=0, NULL=0, NULL=-7, NULL=0, NULL=0, retValue_acc=1, NULL=711, NULL=-16, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22c46727=0, retValue_acc=0, NULL=-11, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e3adeb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@131ab618=60, NULL=-21, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1918e6c8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b402ae6=0, NULL=-12, NULL=-1, methaneLevelCritical=0, tmp___0=0, NULL=0, NULL=0, retValue_acc=0, NULL=0, tmp___1=0, NULL=-17, tmp___0=0, cleanupTimeShifts=4, tmp=0, NULL=-5, NULL=710, NULL=-24, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bc73a13=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67cc9f24=0, NULL=0, systemActive=1, waterLevel=1, NULL=-20, \result=1, NULL=-6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cc95a0a=0, NULL=0, \result=0, NULL=-14, NULL=-10, NULL=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@638f0dbd=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, NULL=-4, NULL=-18, \result=0, NULL=-15, tmp=1, NULL=0, NULL=0, NULL=0, \result=1, NULL=-19, NULL=-23, tmp=1, retValue_acc=1, NULL=0, tmp=1, tmp___2=60, retValue_acc=1, splverifierCounter=0, NULL=0, NULL=-13, tmp=0, head=0, NULL=-8, NULL=0, NULL=0, NULL=-3, NULL=-9, NULL=0, NULL=-22} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L148] int pumpRunning = 0; [L149] int systemActive = 1; [L315] int cleanupTimeShifts = 4; [L583] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L824] int waterLevel = 1; [L825] int methaneLevelCritical = 0; [L391] int retValue_acc ; [L392] int tmp ; [L815] int retValue_acc ; [L818] retValue_acc = 1 [L819] return (retValue_acc); [L398] tmp = valid_product() [L400] COND TRUE \read(tmp) [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 Loop: [L55] COND TRUE 1 [L57] COND TRUE splverifierCounter < 4 [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) [L155] COND FALSE !(\read(pumpRunning)) [L162] COND TRUE \read(systemActive) [L184] int tmp ; [L187] COND TRUE ! pumpRunning [L281] int retValue_acc ; [L282] int tmp ; [L283] int tmp___0 ; [L904] int retValue_acc ; [L907] COND TRUE waterLevel < 2 [L908] retValue_acc = 1 [L909] return (retValue_acc); [L287] tmp = isHighWaterSensorDry() [L289] COND TRUE \read(tmp) [L290] tmp___0 = 0 [L294] retValue_acc = tmp___0 [L295] return (retValue_acc); [L189] tmp = isHighWaterLevel() [L191] COND FALSE !(\read(tmp)) [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); [L121] tmp = getWaterLevel() [L123] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...