./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product60.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product60.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 35fb3393fa21a73dc044cf8f864a9671eb135aae .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.1-wip.dd.multireach-323-8d31f38 [2021-07-06 20:36:59,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:36:59,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:36:59,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:36:59,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:36:59,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:36:59,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:36:59,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:36:59,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:36:59,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:36:59,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:36:59,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:36:59,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:36:59,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:36:59,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:36:59,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:36:59,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:36:59,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:36:59,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:36:59,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:36:59,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:36:59,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:36:59,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:36:59,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:36:59,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:36:59,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:36:59,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:36:59,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:36:59,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:36:59,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:36:59,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:36:59,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:36:59,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:36:59,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:36:59,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:36:59,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:36:59,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:36:59,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:36:59,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:36:59,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:36:59,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:36:59,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-07-06 20:36:59,228 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:36:59,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:36:59,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:36:59,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:36:59,230 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:36:59,230 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:36:59,230 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:36:59,231 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:36:59,231 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:36:59,231 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:36:59,232 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:36:59,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:36:59,232 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:36:59,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:36:59,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:36:59,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:36:59,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:36:59,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:36:59,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:36:59,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:36:59,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:36:59,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:36:59,235 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:36:59,235 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 35fb3393fa21a73dc044cf8f864a9671eb135aae [2021-07-06 20:36:59,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:36:59,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:36:59,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:36:59,502 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:36:59,502 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:36:59,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product60.cil.c [2021-07-06 20:36:59,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a60079d/0123323c65d54f029c1d5b1d9ad4f5a2/FLAG2efa38cc9 [2021-07-06 20:36:59,993 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:36:59,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product60.cil.c [2021-07-06 20:37:00,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a60079d/0123323c65d54f029c1d5b1d9ad4f5a2/FLAG2efa38cc9 [2021-07-06 20:37:00,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a60079d/0123323c65d54f029c1d5b1d9ad4f5a2 [2021-07-06 20:37:00,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:37:00,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:37:00,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:37:00,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:37:00,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:37:00,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bd749f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00, skipping insertion in model container [2021-07-06 20:37:00,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:37:00,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:37:00,530 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product60.cil.c[17751,17764] [2021-07-06 20:37:00,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:37:00,541 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:37:00,592 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product60.cil.c[17751,17764] [2021-07-06 20:37:00,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:37:00,617 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:37:00,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00 WrapperNode [2021-07-06 20:37:00,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:37:00,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:37:00,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:37:00,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:37:00,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:37:00,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:37:00,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:37:00,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:37:00,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:37:00,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:37:00,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:37:00,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:37:00,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (1/1) ... [2021-07-06 20:37:00,696 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:37:00,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:37:00,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-07-06 20:37:00,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-07-06 20:37:00,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:37:00,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:37:00,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:37:00,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:37:01,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:37:01,287 INFO L299 CfgBuilder]: Removed 212 assume(true) statements. [2021-07-06 20:37:01,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:37:01 BoogieIcfgContainer [2021-07-06 20:37:01,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:37:01,289 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:37:01,289 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:37:01,291 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:37:01,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:37:01,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:37:00" (1/3) ... [2021-07-06 20:37:01,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e33dc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:37:01, skipping insertion in model container [2021-07-06 20:37:01,292 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:37:01,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:37:00" (2/3) ... [2021-07-06 20:37:01,293 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e33dc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:37:01, skipping insertion in model container [2021-07-06 20:37:01,293 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:37:01,293 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:37:01" (3/3) ... [2021-07-06 20:37:01,294 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product60.cil.c [2021-07-06 20:37:01,318 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:37:01,318 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:37:01,319 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:37:01,319 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:37:01,319 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:37:01,319 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:37:01,319 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:37:01,319 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:37:01,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:01,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-07-06 20:37:01,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:37:01,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:37:01,350 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:01,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:01,350 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:37:01,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:01,359 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-07-06 20:37:01,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:37:01,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:37:01,360 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:01,360 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:01,363 INFO L791 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(13);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string76.base, #t~string76.offset, 1);call write~init~int(77, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(101, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(116, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(104, #t~string76.base, 4 + #t~string76.offset, 1);call write~init~int(58, #t~string76.base, 5 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 6 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string78.base, #t~string78.offset, 1);call write~init~int(82, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(73, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(84, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string80.base, #t~string80.offset, 1);call write~init~int(75, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 2 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string82.base, #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 1 + #t~string82.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 20#L-1true havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 109#L908true havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 115#L916true main_#t~ret71 := valid_product_#res;main_~tmp~10 := main_#t~ret71;havoc main_#t~ret71; 119#L872true assume 0 != main_~tmp~10; 91#L845true ~switchedOnBeforeTS~0 := 0; 90#L377true havoc test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_#t~nondet32, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 8#L398-1true [2021-07-06 20:37:01,363 INFO L793 eck$LassoCheckResult]: Loop: 8#L398-1true assume !false; 92#L311true assume test_~splverifierCounter~0 < 4; 58#L312true test_~tmp~5 := test_#t~nondet29;havoc test_#t~nondet29; 59#L320true assume !(0 != test_~tmp~5); 60#L320-1true test_~tmp___0~2 := test_#t~nondet30;havoc test_#t~nondet30; 113#L330true assume !(0 != test_~tmp___0~2); 97#L330-1true test_~tmp___2~0 := test_#t~nondet31;havoc test_#t~nondet31; 22#L340true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 56#L348-1true havoc __utac_acc__Specification5_spec__2_#t~ret33;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 127#L195true __utac_acc__Specification5_spec__2_#t~ret33 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret33;havoc __utac_acc__Specification5_spec__2_#t~ret33; 6#L387true assume !(0 != ~pumpRunning~0); 102#L66true assume !(0 != ~systemActive~0); 18#L73true havoc __utac_acc__Specification5_spec__3_#t~ret34, __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 65#L1005true __utac_acc__Specification5_spec__3_#t~ret34 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret34;havoc __utac_acc__Specification5_spec__3_#t~ret34; 4#L398true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 8#L398-1true [2021-07-06 20:37:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2021-07-06 20:37:01,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:01,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29161351] [2021-07-06 20:37:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:01,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:01,499 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:01,550 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:01,571 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:37:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:01,573 INFO L82 PathProgramCache]: Analyzing trace with hash 677719542, now seen corresponding path program 1 times [2021-07-06 20:37:01,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:01,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471453965] [2021-07-06 20:37:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:01,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:37:01,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:01,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:37:01,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:01,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:37:01,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:01,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:37:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:37:01,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:37:01,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471453965] [2021-07-06 20:37:01,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471453965] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:37:01,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:37:01,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:37:01,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230866495] [2021-07-06 20:37:01,610 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:37:01,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:37:01,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:37:01,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:37:01,620 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:37:01,674 INFO L93 Difference]: Finished difference Result 279 states and 401 transitions. [2021-07-06 20:37:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:37:01,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 401 transitions. [2021-07-06 20:37:01,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 182 [2021-07-06 20:37:01,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 265 states and 386 transitions. [2021-07-06 20:37:01,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 265 [2021-07-06 20:37:01,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 265 [2021-07-06 20:37:01,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 386 transitions. [2021-07-06 20:37:01,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:37:01,689 INFO L681 BuchiCegarLoop]: Abstraction has 265 states and 386 transitions. [2021-07-06 20:37:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 386 transitions. [2021-07-06 20:37:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2021-07-06 20:37:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 263 states have (on average 1.456273764258555) internal successors, (383), 262 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 383 transitions. [2021-07-06 20:37:01,725 INFO L704 BuchiCegarLoop]: Abstraction has 263 states and 383 transitions. [2021-07-06 20:37:01,726 INFO L587 BuchiCegarLoop]: Abstraction has 263 states and 383 transitions. [2021-07-06 20:37:01,726 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:37:01,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 383 transitions. [2021-07-06 20:37:01,735 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 180 [2021-07-06 20:37:01,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:37:01,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:37:01,736 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:01,736 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:01,737 INFO L791 eck$LassoCheckResult]: Stem: 555#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(13);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string76.base, #t~string76.offset, 1);call write~init~int(77, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(101, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(116, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(104, #t~string76.base, 4 + #t~string76.offset, 1);call write~init~int(58, #t~string76.base, 5 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 6 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string78.base, #t~string78.offset, 1);call write~init~int(82, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(73, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(84, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string80.base, #t~string80.offset, 1);call write~init~int(75, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 2 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string82.base, #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 1 + #t~string82.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 466#L-1 havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 467#L908 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 566#L916 main_#t~ret71 := valid_product_#res;main_~tmp~10 := main_#t~ret71;havoc main_#t~ret71; 571#L872 assume 0 != main_~tmp~10; 542#L845 ~switchedOnBeforeTS~0 := 0; 540#L377 havoc test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_#t~nondet32, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 541#L398-1 [2021-07-06 20:37:01,737 INFO L793 eck$LassoCheckResult]: Loop: 541#L398-1 assume !false; 615#L311 assume test_~splverifierCounter~0 < 4; 513#L312 test_~tmp~5 := test_#t~nondet29;havoc test_#t~nondet29; 514#L320 assume !(0 != test_~tmp~5); 506#L320-1 test_~tmp___0~2 := test_#t~nondet30;havoc test_#t~nondet30; 515#L330 assume !(0 != test_~tmp___0~2); 552#L330-1 test_~tmp___2~0 := test_#t~nondet31;havoc test_#t~nondet31; 468#L340 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 470#L348-1 havoc __utac_acc__Specification5_spec__2_#t~ret33;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 511#L195 __utac_acc__Specification5_spec__2_#t~ret33 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret33;havoc __utac_acc__Specification5_spec__2_#t~ret33; 438#L387 assume !(0 != ~pumpRunning~0); 439#L66 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 525#L124 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret7, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 485#L98-1 assume !(0 == ~pumpRunning~0); 461#L73 havoc __utac_acc__Specification5_spec__3_#t~ret34, __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 462#L1005 __utac_acc__Specification5_spec__3_#t~ret34 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret34;havoc __utac_acc__Specification5_spec__3_#t~ret34; 523#L398 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 541#L398-1 [2021-07-06 20:37:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:01,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2021-07-06 20:37:01,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:01,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807323452] [2021-07-06 20:37:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:01,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:01,795 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:01,858 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:01,866 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:37:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash -532272225, now seen corresponding path program 1 times [2021-07-06 20:37:01,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:01,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386242807] [2021-07-06 20:37:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:01,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:37:01,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:01,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:37:01,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:01,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:37:01,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:01,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:37:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:37:01,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:37:01,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386242807] [2021-07-06 20:37:01,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386242807] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:37:01,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:37:01,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:37:01,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814281670] [2021-07-06 20:37:01,896 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:37:01,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:37:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:37:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:37:01,899 INFO L87 Difference]: Start difference. First operand 263 states and 383 transitions. cyclomatic complexity: 123 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:37:02,026 INFO L93 Difference]: Finished difference Result 362 states and 505 transitions. [2021-07-06 20:37:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:37:02,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 505 transitions. [2021-07-06 20:37:02,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 255 [2021-07-06 20:37:02,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 362 states and 505 transitions. [2021-07-06 20:37:02,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 362 [2021-07-06 20:37:02,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 362 [2021-07-06 20:37:02,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 505 transitions. [2021-07-06 20:37:02,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:37:02,032 INFO L681 BuchiCegarLoop]: Abstraction has 362 states and 505 transitions. [2021-07-06 20:37:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 505 transitions. [2021-07-06 20:37:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2021-07-06 20:37:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 362 states have (on average 1.3950276243093922) internal successors, (505), 361 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 505 transitions. [2021-07-06 20:37:02,069 INFO L704 BuchiCegarLoop]: Abstraction has 362 states and 505 transitions. [2021-07-06 20:37:02,069 INFO L587 BuchiCegarLoop]: Abstraction has 362 states and 505 transitions. [2021-07-06 20:37:02,069 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:37:02,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 362 states and 505 transitions. [2021-07-06 20:37:02,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 255 [2021-07-06 20:37:02,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:37:02,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:37:02,071 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:02,071 INFO L843 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, 1, 1] [2021-07-06 20:37:02,071 INFO L791 eck$LassoCheckResult]: Stem: 1185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(13);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string76.base, #t~string76.offset, 1);call write~init~int(77, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(101, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(116, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(104, #t~string76.base, 4 + #t~string76.offset, 1);call write~init~int(58, #t~string76.base, 5 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 6 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string78.base, #t~string78.offset, 1);call write~init~int(82, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(73, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(84, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string80.base, #t~string80.offset, 1);call write~init~int(75, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 2 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string82.base, #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 1 + #t~string82.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 1098#L-1 havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 1099#L908 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 1196#L916 main_#t~ret71 := valid_product_#res;main_~tmp~10 := main_#t~ret71;havoc main_#t~ret71; 1201#L872 assume 0 != main_~tmp~10; 1177#L845 ~switchedOnBeforeTS~0 := 0; 1175#L377 havoc test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_#t~nondet32, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1176#L398-1 [2021-07-06 20:37:02,072 INFO L793 eck$LassoCheckResult]: Loop: 1176#L398-1 assume !false; 1395#L311 assume test_~splverifierCounter~0 < 4; 1396#L312 test_~tmp~5 := test_#t~nondet29;havoc test_#t~nondet29; 1421#L320 assume !(0 != test_~tmp~5); 1419#L320-1 test_~tmp___0~2 := test_#t~nondet30;havoc test_#t~nondet30; 1418#L330 assume !(0 != test_~tmp___0~2); 1416#L330-1 test_~tmp___2~0 := test_#t~nondet31;havoc test_#t~nondet31; 1415#L340 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1102#L348-1 havoc __utac_acc__Specification5_spec__2_#t~ret33;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 1413#L195 __utac_acc__Specification5_spec__2_#t~ret33 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret33;havoc __utac_acc__Specification5_spec__2_#t~ret33; 1412#L387 assume !(0 != ~pumpRunning~0); 1186#L66 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 1157#L124 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret7, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 1116#L98-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~12;havoc isHighWaterSensorDry_~retValue_acc~12; 1117#L1013-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~12 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~12; 1158#L1018-1 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 1355#L244-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 1353#L244-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1351#L250-1 processEnvironment__wrappee__highWaterSensor_#t~ret7 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret7;havoc processEnvironment__wrappee__highWaterSensor_#t~ret7; 1349#L102-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 1342#L73 havoc __utac_acc__Specification5_spec__3_#t~ret34, __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 1401#L1005 __utac_acc__Specification5_spec__3_#t~ret34 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret34;havoc __utac_acc__Specification5_spec__3_#t~ret34; 1399#L398 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~6); 1176#L398-1 [2021-07-06 20:37:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2021-07-06 20:37:02,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:02,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548284770] [2021-07-06 20:37:02,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:02,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,108 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,126 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,132 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:37:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1637117461, now seen corresponding path program 1 times [2021-07-06 20:37:02,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:02,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394983689] [2021-07-06 20:37:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:02,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:37:02,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:02,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:37:02,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:02,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:37:02,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:02,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:37:02,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:02,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:37:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-06 20:37:02,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:37:02,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394983689] [2021-07-06 20:37:02,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394983689] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:37:02,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:37:02,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-06 20:37:02,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895693204] [2021-07-06 20:37:02,153 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:37:02,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:37:02,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:37:02,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:37:02,154 INFO L87 Difference]: Start difference. First operand 362 states and 505 transitions. cyclomatic complexity: 146 Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:37:02,296 INFO L93 Difference]: Finished difference Result 1022 states and 1397 transitions. [2021-07-06 20:37:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:37:02,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1022 states and 1397 transitions. [2021-07-06 20:37:02,301 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 671 [2021-07-06 20:37:02,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1022 states to 1022 states and 1397 transitions. [2021-07-06 20:37:02,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1022 [2021-07-06 20:37:02,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1022 [2021-07-06 20:37:02,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1022 states and 1397 transitions. [2021-07-06 20:37:02,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:37:02,308 INFO L681 BuchiCegarLoop]: Abstraction has 1022 states and 1397 transitions. [2021-07-06 20:37:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states and 1397 transitions. [2021-07-06 20:37:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 717. [2021-07-06 20:37:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 717 states have (on average 1.3598326359832635) internal successors, (975), 716 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:37:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 975 transitions. [2021-07-06 20:37:02,323 INFO L704 BuchiCegarLoop]: Abstraction has 717 states and 975 transitions. [2021-07-06 20:37:02,324 INFO L587 BuchiCegarLoop]: Abstraction has 717 states and 975 transitions. [2021-07-06 20:37:02,324 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:37:02,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 717 states and 975 transitions. [2021-07-06 20:37:02,326 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 510 [2021-07-06 20:37:02,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:37:02,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:37:02,327 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:37:02,327 INFO L843 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, 1, 1, 1, 1] [2021-07-06 20:37:02,327 INFO L791 eck$LassoCheckResult]: Stem: 2598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(110, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string54.base, #t~string54.offset := #Ultimate.allocOnStack(30);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(9);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(21);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(30);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(9);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(21);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(30);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(9);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(25);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(30);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(9);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(25);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(13);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string76.base, #t~string76.offset, 1);call write~init~int(77, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(101, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(116, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(104, #t~string76.base, 4 + #t~string76.offset, 1);call write~init~int(58, #t~string76.base, 5 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 6 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string78.base, #t~string78.offset, 1);call write~init~int(82, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(73, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(84, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string80.base, #t~string80.offset, 1);call write~init~int(75, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 2 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string82.base, #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 1 + #t~string82.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 2498#L-1 havoc main_#res;havoc main_#t~ret71, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 2499#L908 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 2609#L916 main_#t~ret71 := valid_product_#res;main_~tmp~10 := main_#t~ret71;havoc main_#t~ret71; 2616#L872 assume 0 != main_~tmp~10; 2588#L845 ~switchedOnBeforeTS~0 := 0; 2587#L377 havoc test_#t~nondet29, test_#t~nondet30, test_#t~nondet31, test_#t~nondet32, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2473#L398-1 [2021-07-06 20:37:02,327 INFO L793 eck$LassoCheckResult]: Loop: 2473#L398-1 assume !false; 2474#L311 assume test_~splverifierCounter~0 < 4; 2552#L312 test_~tmp~5 := test_#t~nondet29;havoc test_#t~nondet29; 2553#L320 assume !(0 != test_~tmp~5); 2555#L320-1 test_~tmp___0~2 := test_#t~nondet30;havoc test_#t~nondet30; 2556#L330 assume !(0 != test_~tmp___0~2); 2596#L330-1 test_~tmp___2~0 := test_#t~nondet31;havoc test_#t~nondet31; 2500#L340 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2502#L348-1 havoc __utac_acc__Specification5_spec__2_#t~ret33;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 2549#L195 __utac_acc__Specification5_spec__2_#t~ret33 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret33;havoc __utac_acc__Specification5_spec__2_#t~ret33; 2468#L387 assume !(0 != ~pumpRunning~0); 2469#L66 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret8, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 2565#L124 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret7, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 2517#L98-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~12;havoc isHighWaterSensorDry_~retValue_acc~12; 2518#L1013-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~12 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~12; 2568#L1018-1 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 2599#L244-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 2624#L244-5 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 2622#L250-1 processEnvironment__wrappee__highWaterSensor_#t~ret7 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret7;havoc processEnvironment__wrappee__highWaterSensor_#t~ret7; 2560#L102-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 2492#L73 havoc __utac_acc__Specification5_spec__3_#t~ret34, __utac_acc__Specification5_spec__3_#t~ret35, __utac_acc__Specification5_spec__3_~tmp~6, __utac_acc__Specification5_spec__3_~tmp___0~3;havoc __utac_acc__Specification5_spec__3_~tmp~6;havoc __utac_acc__Specification5_spec__3_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~11;havoc getWaterLevel_~retValue_acc~11;getWaterLevel_~retValue_acc~11 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~11; 2493#L1005 __utac_acc__Specification5_spec__3_#t~ret34 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~6 := __utac_acc__Specification5_spec__3_#t~ret34;havoc __utac_acc__Specification5_spec__3_#t~ret34; 2466#L398 assume 2 != __utac_acc__Specification5_spec__3_~tmp~6;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~1;havoc isPumpRunning_~retValue_acc~1;isPumpRunning_~retValue_acc~1 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~1; 2467#L195-1 __utac_acc__Specification5_spec__3_#t~ret35 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~3 := __utac_acc__Specification5_spec__3_#t~ret35;havoc __utac_acc__Specification5_spec__3_#t~ret35; 2574#L402 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~3); 2473#L398-1 [2021-07-06 20:37:02,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 4 times [2021-07-06 20:37:02,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:02,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125503938] [2021-07-06 20:37:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:02,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,343 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,368 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,373 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:37:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1311860826, now seen corresponding path program 1 times [2021-07-06 20:37:02,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:02,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592697732] [2021-07-06 20:37:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:02,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,377 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,380 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,382 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:37:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:37:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1375287008, now seen corresponding path program 1 times [2021-07-06 20:37:02,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:37:02,383 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029431815] [2021-07-06 20:37:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:37:02,383 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:37:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,398 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:37:02,411 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:37:02,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:37:02,533 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-07-06 20:37:02,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:02,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-06 20:37:43,751 WARN L205 SmtUtils]: Spent 41.13 s on a formula simplification. DAG size of input: 495 DAG size of output: 437 [2021-07-06 20:37:43,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:37:43,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2130 [2021-07-06 20:38:05,268 WARN L205 SmtUtils]: Spent 21.46 s on a formula simplification that was a NOOP. DAG size: 435 [2021-07-06 20:38:05,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:38:05 BoogieIcfgContainer [2021-07-06 20:38:05,392 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:38:05,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:38:05,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:38:05,392 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:38:05,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:37:01" (3/4) ... [2021-07-06 20:38:05,394 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:38:05,421 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:38:05,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:38:05,422 INFO L168 Benchmark]: Toolchain (without parser) took 65114.92 ms. Allocated memory was 58.7 MB in the beginning and 136.3 MB in the end (delta: 77.6 MB). Free memory was 36.5 MB in the beginning and 51.3 MB in the end (delta: -14.7 MB). Peak memory consumption was 63.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,422 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 58.7 MB. Free memory is still 40.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:38:05,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.33 ms. Allocated memory is still 58.7 MB. Free memory was 36.4 MB in the beginning and 30.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.32 ms. Allocated memory was 58.7 MB in the beginning and 81.8 MB in the end (delta: 23.1 MB). Free memory was 30.0 MB in the beginning and 64.1 MB in the end (delta: -34.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,423 INFO L168 Benchmark]: Boogie Preprocessor took 24.77 ms. Allocated memory is still 81.8 MB. Free memory was 64.1 MB in the beginning and 61.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,423 INFO L168 Benchmark]: RCFGBuilder took 597.05 ms. Allocated memory is still 81.8 MB. Free memory was 61.1 MB in the beginning and 41.4 MB in the end (delta: 19.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,424 INFO L168 Benchmark]: BuchiAutomizer took 64102.82 ms. Allocated memory was 81.8 MB in the beginning and 136.3 MB in the end (delta: 54.5 MB). Free memory was 41.4 MB in the beginning and 53.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 72.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,424 INFO L168 Benchmark]: Witness Printer took 29.44 ms. Allocated memory is still 136.3 MB. Free memory was 53.4 MB in the beginning and 51.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:38:05,425 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 58.7 MB. Free memory is still 40.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 309.33 ms. Allocated memory is still 58.7 MB. Free memory was 36.4 MB in the beginning and 30.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.32 ms. Allocated memory was 58.7 MB in the beginning and 81.8 MB in the end (delta: 23.1 MB). Free memory was 30.0 MB in the beginning and 64.1 MB in the end (delta: -34.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.77 ms. Allocated memory is still 81.8 MB. Free memory was 64.1 MB in the beginning and 61.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 597.05 ms. Allocated memory is still 81.8 MB. Free memory was 61.1 MB in the beginning and 41.4 MB in the end (delta: 19.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 64102.82 ms. Allocated memory was 81.8 MB in the beginning and 136.3 MB in the end (delta: 54.5 MB). Free memory was 41.4 MB in the beginning and 53.4 MB in the end (delta: -11.9 MB). Peak memory consumption was 72.8 MB. Max. memory is 16.1 GB. * Witness Printer took 29.44 ms. Allocated memory is still 136.3 MB. Free memory was 53.4 MB in the beginning and 51.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 717 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 64.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 63.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 79.0ms AutomataMinimizationTime, 3 MinimizatonAttempts, 307 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 717 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 679 SDtfs, 1007 SDslu, 911 SDs, 0 SdLazy, 145 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 207.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 310]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=21730} State at position 1 is {retValue_acc=1, NULL=0, NULL=0, NULL=21758, NULL=0, NULL=21730, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c8a3129=0, NULL=21742, methaneLevelCritical=0, NULL=21739, NULL=0, tmp=0, NULL=0, retValue_acc=0, NULL=21751, NULL=0, tmp___1=0, NULL=0, NULL=21756, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24284a59=0, NULL=21738, tmp=1, waterLevel=1, NULL=21757, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17357787=0, \result=1, head=0, pumpRunning=0, NULL=21754, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53a20c0c=0, NULL=21752, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30133f78=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@606870c2=65, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74903c0=0, NULL=0, tmp=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4c5f48a0=0, NULL=0, tmp___0=0, NULL=21732, NULL=21734, NULL=21733, tmp=0, head=0, NULL=0, NULL=21731, NULL=21750, retValue_acc=0, NULL=21749, tmp=1, NULL=0, tmp___0=0, NULL=0, NULL=21735, NULL=0, NULL=0, tmp=0, switchedOnBeforeTS=0, \result=0, NULL=0, systemActive=1, \result=1, NULL=21744, NULL=0, NULL=21740, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=0, NULL=21747, NULL=21748, \result=0, tmp___0=0, NULL=21736, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69464898=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@217a3257=0, NULL=0, NULL=21745, retValue_acc=1, NULL=21753, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e6c28e9=0, NULL=21746, retValue_acc=1, tmp___2=65, splverifierCounter=0, NULL=0, NULL=0, NULL=21743, retValue_acc=0, NULL=0, NULL=0, NULL=21741, NULL=0, NULL=21755, NULL=21737} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L54] int pumpRunning = 0; [L55] int systemActive = 1; [L371] int switchedOnBeforeTS ; [L589] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L786] int cleanupTimeShifts = 4; [L930] int waterLevel = 1; [L931] int methaneLevelCritical = 0; [L863] int retValue_acc ; [L864] int tmp ; [L912] int retValue_acc ; [L915] retValue_acc = 1 [L916] return (retValue_acc); [L870] tmp = valid_product() [L872] COND TRUE \read(tmp) [L376] switchedOnBeforeTS = 0 [L301] int splverifierCounter ; [L302] int tmp ; [L303] int tmp___0 ; [L304] int tmp___1 ; [L305] int tmp___2 ; [L308] splverifierCounter = 0 Loop: [L310] COND TRUE 1 [L312] COND TRUE splverifierCounter < 4 [L318] tmp = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp)) [L328] tmp___0 = __VERIFIER_nondet_int() [L330] COND FALSE !(\read(tmp___0)) [L338] tmp___2 = __VERIFIER_nondet_int() [L340] COND TRUE \read(tmp___2) [L292] systemActive = 1 [L191] int retValue_acc ; [L194] retValue_acc = pumpRunning [L195] return (retValue_acc); [L385] switchedOnBeforeTS = isPumpRunning() [L66] COND FALSE !(\read(pumpRunning)) [L73] COND TRUE \read(systemActive) [L121] int tmp ; [L124] COND FALSE !(\read(pumpRunning)) [L95] int tmp ; [L98] COND TRUE ! pumpRunning [L236] int retValue_acc ; [L237] int tmp ; [L238] int tmp___0 ; [L1010] int retValue_acc ; [L1013] COND TRUE waterLevel < 2 [L1014] retValue_acc = 1 [L1015] return (retValue_acc); [L242] tmp = isHighWaterSensorDry() [L244] COND TRUE \read(tmp) [L245] tmp___0 = 0 [L249] retValue_acc = tmp___0 [L250] return (retValue_acc); [L100] tmp = isHighWaterLevel() [L102] COND FALSE !(\read(tmp)) [L391] int tmp ; [L392] int tmp___0 ; [L1001] int retValue_acc ; [L1004] retValue_acc = waterLevel [L1005] return (retValue_acc); [L396] tmp = getWaterLevel() [L398] COND TRUE tmp != 2 [L191] int retValue_acc ; [L194] retValue_acc = pumpRunning [L195] return (retValue_acc); [L400] tmp___0 = isPumpRunning() [L402] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:38:05,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...