./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product51.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_spec3_product51.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 766a879002f02395031e659ac25b856858b20e6e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:39,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:25:39,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:25:39,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:25:39,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:25:39,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:25:39,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:25:39,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:25:39,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:25:39,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:25:39,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:25:39,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:25:39,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:25:39,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:25:39,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:25:39,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:25:39,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:25:39,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:25:39,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:25:39,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:25:39,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:25:39,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:25:39,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:25:39,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:25:39,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:25:39,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:25:39,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:25:39,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:25:39,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:25:39,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:25:39,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:25:39,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:25:39,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:25:39,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:25:39,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:25:39,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:25:39,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:25:39,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:25:39,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:25:39,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:25:39,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:25:39,294 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:25:39,321 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:25:39,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:25:39,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:25:39,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:25:39,323 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:25:39,323 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:25:39,323 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:25:39,324 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:25:39,324 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:25:39,324 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:25:39,325 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:25:39,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:25:39,325 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:25:39,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:25:39,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:25:39,326 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:25:39,327 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:25:39,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:25:39,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:25:39,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:25:39,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:25:39,327 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:25:39,327 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:25:39,328 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:25:39,328 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 -> 766a879002f02395031e659ac25b856858b20e6e [2021-07-06 20:25:39,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:25:39,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:25:39,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:25:39,618 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:25:39,618 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:25:39,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product51.cil.c [2021-07-06 20:25:39,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb43ec2f/330523fcb8af449b89e4c914092dc037/FLAG84d6b82db [2021-07-06 20:25:40,081 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:25:40,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product51.cil.c [2021-07-06 20:25:40,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb43ec2f/330523fcb8af449b89e4c914092dc037/FLAG84d6b82db [2021-07-06 20:25:40,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edb43ec2f/330523fcb8af449b89e4c914092dc037 [2021-07-06 20:25:40,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:25:40,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:25:40,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:25:40,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:25:40,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:25:40,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a05abab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40, skipping insertion in model container [2021-07-06 20:25:40,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:25:40,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:25:40,389 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_spec3_product51.cil.c[18465,18478] [2021-07-06 20:25:40,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:25:40,404 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:25:40,452 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_spec3_product51.cil.c[18465,18478] [2021-07-06 20:25:40,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:25:40,471 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:25:40,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40 WrapperNode [2021-07-06 20:25:40,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:25:40,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:25:40,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:25:40,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:25:40,476 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:25:40" (1/1) ... [2021-07-06 20:25:40,486 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:25:40" (1/1) ... [2021-07-06 20:25:40,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:25:40,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:25:40,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:25:40,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:25:40,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:25:40,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:25:40,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:25:40,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:25:40,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (1/1) ... [2021-07-06 20:25:40,537 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:25:40,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:25:40,578 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:25:40,610 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:25:40,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:25:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:25:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:25:40,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:25:41,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:25:41,292 INFO L299 CfgBuilder]: Removed 166 assume(true) statements. [2021-07-06 20:25:41,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:41 BoogieIcfgContainer [2021-07-06 20:25:41,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:25:41,294 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:25:41,294 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:25:41,296 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:25:41,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:41,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:25:40" (1/3) ... [2021-07-06 20:25:41,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a298a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:25:41, skipping insertion in model container [2021-07-06 20:25:41,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:41,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:40" (2/3) ... [2021-07-06 20:25:41,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a298a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:25:41, skipping insertion in model container [2021-07-06 20:25:41,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:41,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:41" (3/3) ... [2021-07-06 20:25:41,299 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product51.cil.c [2021-07-06 20:25:41,332 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:25:41,333 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:25:41,333 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:25:41,333 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:25:41,333 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:25:41,333 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:25:41,333 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:25:41,333 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:25:41,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.537190082644628) internal successors, (186), 121 states have internal predecessors, (186), 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:25:41,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2021-07-06 20:25:41,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:41,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:41,367 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:41,367 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:41,367 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:25:41,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.537190082644628) internal successors, (186), 121 states have internal predecessors, (186), 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:25:41,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2021-07-06 20:25:41,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:41,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:41,373 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:41,373 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:41,376 INFO L791 eck$LassoCheckResult]: Stem: 91#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~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);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(75, #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(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 12#L-1true havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 13#L596true havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 41#L604true main_#t~ret45 := valid_product_#res;main_~tmp~6 := main_#t~ret45;havoc main_#t~ret45; 45#L560true assume 0 != main_~tmp~6; 86#L534true havoc test_#t~nondet17, test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 114#L456-1true [2021-07-06 20:25:41,376 INFO L793 eck$LassoCheckResult]: Loop: 114#L456-1true assume !false; 107#L167true assume test_~splverifierCounter~0 < 4; 72#L168true test_~tmp~0 := test_#t~nondet17;havoc test_#t~nondet17; 81#L176true assume !(0 != test_~tmp~0); 80#L176-1true test_~tmp___0~0 := test_#t~nondet18;havoc test_#t~nondet18; 5#L186true assume !(0 != test_~tmp___0~0); 19#L186-1true test_~tmp___2~0 := test_#t~nondet19;havoc test_#t~nondet19; 67#L196true assume 0 != test_~tmp___2~0; 36#L202-1true assume !(0 != ~pumpRunning~0); 55#L235true assume !(0 != ~systemActive~0); 85#L242true havoc __utac_acc__Specification3_spec__1_#t~ret42, __utac_acc__Specification3_spec__1_#t~ret43, __utac_acc__Specification3_spec__1_#t~ret44, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 97#L93true __utac_acc__Specification3_spec__1_#t~ret42 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret42;havoc __utac_acc__Specification3_spec__1_#t~ret42; 25#L450true assume 0 != __utac_acc__Specification3_spec__1_~tmp~5; 114#L456-1true [2021-07-06 20:25:41,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:25:41,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:41,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065674067] [2021-07-06 20:25:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:41,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:41,531 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:41,591 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:41,609 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:41,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1671186434, now seen corresponding path program 1 times [2021-07-06 20:25:41,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:41,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059158440] [2021-07-06 20:25:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:41,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:41,616 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:41,618 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:41,621 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:41,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:41,622 INFO L82 PathProgramCache]: Analyzing trace with hash 43092504, now seen corresponding path program 1 times [2021-07-06 20:25:41,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:41,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823453466] [2021-07-06 20:25:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:41,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:41,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:41,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:41,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:41,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:41,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:41,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:41,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:41,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:25:41,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:41,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:41,694 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:25:41,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:41,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823453466] [2021-07-06 20:25:41,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823453466] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:41,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:41,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:25:41,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702980927] [2021-07-06 20:25:41,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:41,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-06 20:25:41,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:25:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:25:41,773 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.537190082644628) internal successors, (186), 121 states have internal predecessors, (186), 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 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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:25:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:41,924 INFO L93 Difference]: Finished difference Result 294 states and 423 transitions. [2021-07-06 20:25:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:25:41,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 423 transitions. [2021-07-06 20:25:41,930 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 189 [2021-07-06 20:25:41,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 273 states and 402 transitions. [2021-07-06 20:25:41,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2021-07-06 20:25:41,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 273 [2021-07-06 20:25:41,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 273 states and 402 transitions. [2021-07-06 20:25:41,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:41,938 INFO L681 BuchiCegarLoop]: Abstraction has 273 states and 402 transitions. [2021-07-06 20:25:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states and 402 transitions. [2021-07-06 20:25:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 162. [2021-07-06 20:25:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 1.462962962962963) internal successors, (237), 161 states have internal predecessors, (237), 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:25:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2021-07-06 20:25:41,961 INFO L704 BuchiCegarLoop]: Abstraction has 162 states and 237 transitions. [2021-07-06 20:25:41,961 INFO L587 BuchiCegarLoop]: Abstraction has 162 states and 237 transitions. [2021-07-06 20:25:41,961 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:25:41,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 237 transitions. [2021-07-06 20:25:41,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2021-07-06 20:25:41,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:41,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:41,964 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:41,964 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:25:41,964 INFO L791 eck$LassoCheckResult]: Stem: 541#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~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);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(75, #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(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 452#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 453#L596 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 454#L604 main_#t~ret45 := valid_product_#res;main_~tmp~6 := main_#t~ret45;havoc main_#t~ret45; 501#L560 assume 0 != main_~tmp~6; 504#L534 havoc test_#t~nondet17, test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 476#L456-1 [2021-07-06 20:25:41,964 INFO L793 eck$LassoCheckResult]: Loop: 476#L456-1 assume !false; 545#L167 assume test_~splverifierCounter~0 < 4; 529#L168 test_~tmp~0 := test_#t~nondet17;havoc test_#t~nondet17; 530#L176 assume !(0 != test_~tmp~0); 534#L176-1 test_~tmp___0~0 := test_#t~nondet18;havoc test_#t~nondet18; 438#L186 assume !(0 != test_~tmp___0~0); 439#L186-1 test_~tmp___2~0 := test_#t~nondet19;havoc test_#t~nondet19; 464#L196 assume 0 != test_~tmp___2~0; 491#L202-1 assume !(0 != ~pumpRunning~0); 493#L235 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 468#L293 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret21, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 470#L267-1 assume !(0 == ~pumpRunning~0); 466#L242 havoc __utac_acc__Specification3_spec__1_#t~ret42, __utac_acc__Specification3_spec__1_#t~ret43, __utac_acc__Specification3_spec__1_#t~ret44, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 538#L93 __utac_acc__Specification3_spec__1_#t~ret42 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret42;havoc __utac_acc__Specification3_spec__1_#t~ret42; 474#L450 assume 0 != __utac_acc__Specification3_spec__1_~tmp~5; 476#L456-1 [2021-07-06 20:25:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:25:41,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:41,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112750576] [2021-07-06 20:25:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:41,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:41,992 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,015 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1961899900, now seen corresponding path program 1 times [2021-07-06 20:25:42,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999187677] [2021-07-06 20:25:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:42,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:42,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:42,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:42,049 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:25:42,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:42,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999187677] [2021-07-06 20:25:42,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999187677] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:42,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:42,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:42,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833081654] [2021-07-06 20:25:42,050 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:25:42,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:25:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:25:42,051 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. cyclomatic complexity: 78 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:25:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:42,099 INFO L93 Difference]: Finished difference Result 207 states and 286 transitions. [2021-07-06 20:25:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:25:42,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 286 transitions. [2021-07-06 20:25:42,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2021-07-06 20:25:42,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 286 transitions. [2021-07-06 20:25:42,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2021-07-06 20:25:42,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2021-07-06 20:25:42,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 286 transitions. [2021-07-06 20:25:42,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:42,104 INFO L681 BuchiCegarLoop]: Abstraction has 207 states and 286 transitions. [2021-07-06 20:25:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 286 transitions. [2021-07-06 20:25:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-07-06 20:25:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 206 states have internal predecessors, (286), 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:25:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 286 transitions. [2021-07-06 20:25:42,109 INFO L704 BuchiCegarLoop]: Abstraction has 207 states and 286 transitions. [2021-07-06 20:25:42,109 INFO L587 BuchiCegarLoop]: Abstraction has 207 states and 286 transitions. [2021-07-06 20:25:42,109 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:25:42,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 286 transitions. [2021-07-06 20:25:42,110 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2021-07-06 20:25:42,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:42,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:42,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:42,111 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] [2021-07-06 20:25:42,111 INFO L791 eck$LassoCheckResult]: Stem: 925#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~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);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(75, #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(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 827#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 828#L596 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 829#L604 main_#t~ret45 := valid_product_#res;main_~tmp~6 := main_#t~ret45;havoc main_#t~ret45; 877#L560 assume 0 != main_~tmp~6; 880#L534 havoc test_#t~nondet17, test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 921#L456-1 [2021-07-06 20:25:42,111 INFO L793 eck$LassoCheckResult]: Loop: 921#L456-1 assume !false; 939#L167 assume test_~splverifierCounter~0 < 4; 940#L168 test_~tmp~0 := test_#t~nondet17;havoc test_#t~nondet17; 1005#L176 assume !(0 != test_~tmp~0); 1003#L176-1 test_~tmp___0~0 := test_#t~nondet18;havoc test_#t~nondet18; 813#L186 assume !(0 != test_~tmp___0~0); 814#L186-1 test_~tmp___2~0 := test_#t~nondet19;havoc test_#t~nondet19; 839#L196 assume 0 != test_~tmp___2~0; 999#L202-1 assume !(0 != ~pumpRunning~0); 892#L235 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 844#L293 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret21, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 845#L267-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret40, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 901#L133-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 902#L138-1 isHighWaterLevel_#t~ret40 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret40;havoc isHighWaterLevel_#t~ret40; 835#L395-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~1 := 0; 836#L395-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 837#L401-1 processEnvironment__wrappee__highWaterSensor_#t~ret21 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret21;havoc processEnvironment__wrappee__highWaterSensor_#t~ret21; 882#L271-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 842#L242 havoc __utac_acc__Specification3_spec__1_#t~ret42, __utac_acc__Specification3_spec__1_#t~ret43, __utac_acc__Specification3_spec__1_#t~ret44, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 920#L93 __utac_acc__Specification3_spec__1_#t~ret42 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret42;havoc __utac_acc__Specification3_spec__1_#t~ret42; 930#L450 assume 0 != __utac_acc__Specification3_spec__1_~tmp~5; 921#L456-1 [2021-07-06 20:25:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:25:42,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2904529] [2021-07-06 20:25:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,132 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,150 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,156 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2099215608, now seen corresponding path program 1 times [2021-07-06 20:25:42,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265419922] [2021-07-06 20:25:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,160 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,162 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,164 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1643144414, now seen corresponding path program 1 times [2021-07-06 20:25:42,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165537730] [2021-07-06 20:25:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:42,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:42,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:42,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:42,195 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:25:42,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:42,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165537730] [2021-07-06 20:25:42,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165537730] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:42,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:42,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:42,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094548394] [2021-07-06 20:25:42,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 20:25:42,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:42,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:25:42,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:25:42,319 INFO L87 Difference]: Start difference. First operand 207 states and 286 transitions. cyclomatic complexity: 82 Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:25:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:42,375 INFO L93 Difference]: Finished difference Result 705 states and 979 transitions. [2021-07-06 20:25:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:25:42,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 705 states and 979 transitions. [2021-07-06 20:25:42,379 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 531 [2021-07-06 20:25:42,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 705 states to 705 states and 979 transitions. [2021-07-06 20:25:42,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 705 [2021-07-06 20:25:42,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 705 [2021-07-06 20:25:42,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 705 states and 979 transitions. [2021-07-06 20:25:42,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:42,384 INFO L681 BuchiCegarLoop]: Abstraction has 705 states and 979 transitions. [2021-07-06 20:25:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states and 979 transitions. [2021-07-06 20:25:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 408. [2021-07-06 20:25:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 408 states have (on average 1.357843137254902) internal successors, (554), 407 states have internal predecessors, (554), 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:25:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 554 transitions. [2021-07-06 20:25:42,392 INFO L704 BuchiCegarLoop]: Abstraction has 408 states and 554 transitions. [2021-07-06 20:25:42,393 INFO L587 BuchiCegarLoop]: Abstraction has 408 states and 554 transitions. [2021-07-06 20:25:42,393 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:25:42,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 408 states and 554 transitions. [2021-07-06 20:25:42,394 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 292 [2021-07-06 20:25:42,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:42,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:42,395 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:42,395 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:25:42,395 INFO L791 eck$LassoCheckResult]: Stem: 1863#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~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);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(75, #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(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~head~0.base, ~head~0.offset := 0, 0; 1757#L-1 havoc main_#res;havoc main_#t~ret45, main_~retValue_acc~8, main_~tmp~6;havoc main_~retValue_acc~8;havoc main_~tmp~6; 1758#L596 havoc valid_product_#res;havoc valid_product_~retValue_acc~10;havoc valid_product_~retValue_acc~10;valid_product_~retValue_acc~10 := 1;valid_product_#res := valid_product_~retValue_acc~10; 1759#L604 main_#t~ret45 := valid_product_#res;main_~tmp~6 := main_#t~ret45;havoc main_#t~ret45; 1808#L560 assume 0 != main_~tmp~6; 1811#L534 havoc test_#t~nondet17, test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1842#L456-1 [2021-07-06 20:25:42,395 INFO L793 eck$LassoCheckResult]: Loop: 1842#L456-1 assume !false; 1876#L167 assume test_~splverifierCounter~0 < 4; 1877#L168 test_~tmp~0 := test_#t~nondet17;havoc test_#t~nondet17; 2146#L176 assume !(0 != test_~tmp~0); 1851#L176-1 test_~tmp___0~0 := test_#t~nondet18;havoc test_#t~nondet18; 1743#L186 assume !(0 != test_~tmp___0~0); 1744#L186-1 test_~tmp___2~0 := test_#t~nondet19;havoc test_#t~nondet19; 1768#L196 assume 0 != test_~tmp___2~0; 1797#L202-1 assume !(0 != ~pumpRunning~0); 1798#L235 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1825#L293 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret21, processEnvironment__wrappee__highWaterSensor_~tmp~1;havoc processEnvironment__wrappee__highWaterSensor_~tmp~1; 2085#L267-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret40, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 2084#L133-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 2082#L138-1 isHighWaterLevel_#t~ret40 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret40;havoc isHighWaterLevel_#t~ret40; 2080#L395-3 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~1 := 0; 2078#L395-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1884#L401-1 processEnvironment__wrappee__highWaterSensor_#t~ret21 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~1 := processEnvironment__wrappee__highWaterSensor_#t~ret21;havoc processEnvironment__wrappee__highWaterSensor_#t~ret21; 1813#L271-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~1); 1771#L242 havoc __utac_acc__Specification3_spec__1_#t~ret42, __utac_acc__Specification3_spec__1_#t~ret43, __utac_acc__Specification3_spec__1_#t~ret44, __utac_acc__Specification3_spec__1_~tmp~5, __utac_acc__Specification3_spec__1_~tmp___0~3, __utac_acc__Specification3_spec__1_~tmp___1~1;havoc __utac_acc__Specification3_spec__1_~tmp~5;havoc __utac_acc__Specification3_spec__1_~tmp___0~3;havoc __utac_acc__Specification3_spec__1_~tmp___1~1;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 1859#L93 __utac_acc__Specification3_spec__1_#t~ret42 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~5 := __utac_acc__Specification3_spec__1_#t~ret42;havoc __utac_acc__Specification3_spec__1_#t~ret42; 1779#L450 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~5);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 1780#L125 __utac_acc__Specification3_spec__1_#t~ret43 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~3 := __utac_acc__Specification3_spec__1_#t~ret43;havoc __utac_acc__Specification3_spec__1_#t~ret43; 1881#L456 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~3); 1842#L456-1 [2021-07-06 20:25:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:25:42,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998520292] [2021-07-06 20:25:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,414 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,441 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,446 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1288438010, now seen corresponding path program 1 times [2021-07-06 20:25:42,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324676204] [2021-07-06 20:25:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,450 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,452 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1486191252, now seen corresponding path program 1 times [2021-07-06 20:25:42,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:42,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226466561] [2021-07-06 20:25:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:42,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,471 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:42,504 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:42,511 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:42,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:42,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-07-06 20:26:21,140 WARN L205 SmtUtils]: Spent 38.49 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:26:21,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:26:21,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:26:41,221 WARN L205 SmtUtils]: Spent 20.04 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:26:41,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:26:41 BoogieIcfgContainer [2021-07-06 20:26:41,297 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:26:41,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:26:41,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:26:41,298 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:26:41,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:41" (3/4) ... [2021-07-06 20:26:41,300 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:26:41,324 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:26:41,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:26:41,325 INFO L168 Benchmark]: Toolchain (without parser) took 61216.73 ms. Allocated memory was 65.0 MB in the beginning and 199.2 MB in the end (delta: 134.2 MB). Free memory was 43.5 MB in the beginning and 74.9 MB in the end (delta: -31.3 MB). Peak memory consumption was 101.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:41,325 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 65.0 MB. Free memory was 46.0 MB in the beginning and 45.9 MB in the end (delta: 51.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:26:41,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.49 ms. Allocated memory is still 65.0 MB. Free memory was 43.4 MB in the beginning and 37.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:41,326 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.19 ms. Allocated memory is still 65.0 MB. Free memory was 36.9 MB in the beginning and 33.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:41,326 INFO L168 Benchmark]: Boogie Preprocessor took 22.07 ms. Allocated memory is still 65.0 MB. Free memory was 33.3 MB in the beginning and 30.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:41,326 INFO L168 Benchmark]: RCFGBuilder took 760.68 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 30.7 MB in the beginning and 53.2 MB in the end (delta: -22.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:41,327 INFO L168 Benchmark]: BuchiAutomizer took 60003.38 ms. Allocated memory was 81.8 MB in the beginning and 199.2 MB in the end (delta: 117.4 MB). Free memory was 53.2 MB in the beginning and 77.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 115.5 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:41,327 INFO L168 Benchmark]: Witness Printer took 26.84 ms. Allocated memory is still 199.2 MB. Free memory was 77.0 MB in the beginning and 74.9 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:26:41,328 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.15 ms. Allocated memory is still 65.0 MB. Free memory was 46.0 MB in the beginning and 45.9 MB in the end (delta: 51.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 361.49 ms. Allocated memory is still 65.0 MB. Free memory was 43.4 MB in the beginning and 37.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.19 ms. Allocated memory is still 65.0 MB. Free memory was 36.9 MB in the beginning and 33.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.07 ms. Allocated memory is still 65.0 MB. Free memory was 33.3 MB in the beginning and 30.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 760.68 ms. Allocated memory was 65.0 MB in the beginning and 81.8 MB in the end (delta: 16.8 MB). Free memory was 30.7 MB in the beginning and 53.2 MB in the end (delta: -22.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 60003.38 ms. Allocated memory was 81.8 MB in the beginning and 199.2 MB in the end (delta: 117.4 MB). Free memory was 53.2 MB in the beginning and 77.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 115.5 MB. Max. memory is 16.1 GB. * Witness Printer took 26.84 ms. Allocated memory is still 199.2 MB. Free memory was 77.0 MB in the beginning and 74.9 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 6 locations. The remainder module has 408 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 59.5s. Construction of modules took 0.1s. 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 28.7ms AutomataMinimizationTime, 3 MinimizatonAttempts, 408 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 408 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 605 SDtfs, 1483 SDslu, 1676 SDs, 0 SdLazy, 117 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 152.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 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: 166]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, NULL=42600, NULL=1, NULL=42585, methaneLevelCritical=0, retValue_acc=1, NULL=0, NULL=42603, NULL=42594, NULL=0, tmp___1=0, NULL=42607, retValue_acc=0, NULL=0, NULL=42592, cleanupTimeShifts=4, tmp=0, tmp=0, NULL=42598, NULL=0, waterLevel=1, NULL=0, tmp___0=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=42597, retValue_acc=1, NULL=0, NULL=0, NULL=0, tmp=1, \result=1, NULL=0, NULL=0, tmp=1, NULL=0, NULL=29444, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49d518c4=60, NULL=42590, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7076a691=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@b652b67=0, tmp=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f688bd5=0, NULL=42602, NULL=0, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68b8e3f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56206ce0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26426923=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@497f193a=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@57fd71ce=0, retValue_acc=0, NULL=42608, NULL=42593, tmp___0=0, NULL=0, NULL=0, NULL=42596, NULL=0, NULL=0, NULL=0, tmp=0, NULL=42606, NULL=42601, tmp___0=1, NULL=0, NULL=0, NULL=0, systemActive=1, NULL=42595, \result=1, NULL=0, NULL=42604, \result=0, NULL=0, NULL=42611, \result=0, NULL=42586, NULL=0, NULL=42599, NULL=42588, NULL=42589, NULL=42609, tmp___2=60, splverifierCounter=0, NULL=0, \result=0, NULL=42610, NULL=42591, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@58c4c550=0, NULL=42605, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@90dd58e=0, NULL=42587} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L50] int waterLevel = 1; [L51] int methaneLevelCritical = 0; [L227] int pumpRunning = 0; [L228] int systemActive = 1; [L475] int cleanupTimeShifts = 4; [L778] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L551] int retValue_acc ; [L552] int tmp ; [L600] int retValue_acc ; [L603] retValue_acc = 1 [L604] return (retValue_acc); [L558] tmp = valid_product() [L560] COND TRUE \read(tmp) [L157] int splverifierCounter ; [L158] int tmp ; [L159] int tmp___0 ; [L160] int tmp___1 ; [L161] int tmp___2 ; [L164] splverifierCounter = 0 Loop: [L166] COND TRUE 1 [L168] COND TRUE splverifierCounter < 4 [L174] tmp = __VERIFIER_nondet_int() [L176] COND FALSE !(\read(tmp)) [L184] tmp___0 = __VERIFIER_nondet_int() [L186] COND FALSE !(\read(tmp___0)) [L194] tmp___2 = __VERIFIER_nondet_int() [L196] COND TRUE \read(tmp___2) [L235] COND FALSE !(\read(pumpRunning)) [L242] COND TRUE \read(systemActive) [L290] int tmp ; [L293] COND FALSE !(\read(pumpRunning)) [L264] int tmp ; [L267] COND TRUE ! pumpRunning [L387] int retValue_acc ; [L388] int tmp ; [L389] int tmp___0 ; [L130] int retValue_acc ; [L133] COND TRUE waterLevel < 2 [L134] retValue_acc = 1 [L135] return (retValue_acc); [L393] tmp = isHighWaterSensorDry() [L395] COND TRUE \read(tmp) [L396] tmp___0 = 0 [L400] retValue_acc = tmp___0 [L401] return (retValue_acc); [L269] tmp = isHighWaterLevel() [L271] COND FALSE !(\read(tmp)) [L442] int tmp ; [L443] int tmp___0 ; [L444] int tmp___1 ; [L89] int retValue_acc ; [L92] retValue_acc = methaneLevelCritical [L93] return (retValue_acc); [L448] tmp = isMethaneLevelCritical() [L450] COND FALSE !(\read(tmp)) [L121] int retValue_acc ; [L124] retValue_acc = waterLevel [L125] return (retValue_acc); [L454] tmp___0 = getWaterLevel() [L456] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:26:41,363 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...