./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product45.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_product45.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 115416f6b9263aced1374dbb9cce15bd25dca014 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:13,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:25:13,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:25:13,060 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:25:13,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:25:13,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:25:13,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:25:13,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:25:13,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:25:13,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:25:13,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:25:13,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:25:13,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:25:13,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:25:13,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:25:13,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:25:13,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:25:13,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:25:13,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:25:13,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:25:13,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:25:13,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:25:13,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:25:13,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:25:13,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:25:13,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:25:13,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:25:13,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:25:13,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:25:13,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:25:13,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:25:13,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:25:13,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:25:13,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:25:13,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:25:13,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:25:13,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:25:13,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:25:13,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:25:13,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:25:13,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:25:13,108 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:13,152 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:25:13,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:25:13,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:25:13,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:25:13,155 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:25:13,155 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:25:13,155 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:25:13,155 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:25:13,155 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:25:13,156 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:25:13,156 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:25:13,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:25:13,157 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:25:13,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:25:13,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:25:13,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:25:13,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:25:13,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:25:13,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:25:13,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:25:13,158 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:25:13,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:25:13,159 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:25:13,159 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:25:13,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:25:13,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:25:13,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:25:13,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:25:13,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:25:13,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:25:13,161 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:25:13,161 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 -> 115416f6b9263aced1374dbb9cce15bd25dca014 [2021-07-06 20:25:13,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:25:13,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:25:13,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:25:13,504 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:25:13,505 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:25:13,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product45.cil.c [2021-07-06 20:25:13,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9931b21d1/3d3bb7f8b6624df4a2d6f9dc905a6812/FLAG8b448256b [2021-07-06 20:25:14,135 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:25:14,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product45.cil.c [2021-07-06 20:25:14,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9931b21d1/3d3bb7f8b6624df4a2d6f9dc905a6812/FLAG8b448256b [2021-07-06 20:25:14,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9931b21d1/3d3bb7f8b6624df4a2d6f9dc905a6812 [2021-07-06 20:25:14,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:25:14,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:25:14,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:25:14,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:25:14,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:25:14,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:25:14" (1/1) ... [2021-07-06 20:25:14,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d51a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:14, skipping insertion in model container [2021-07-06 20:25:14,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:25:14" (1/1) ... [2021-07-06 20:25:14,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:25:14,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:25:14,815 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_product45.cil.c[8293,8306] [2021-07-06 20:25:14,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:25:14,899 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:25:14,962 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_product45.cil.c[8293,8306] [2021-07-06 20:25:14,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:25:15,020 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:25:15,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:15 WrapperNode [2021-07-06 20:25:15,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:25:15,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:25:15,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:25:15,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:25:15,031 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:15" (1/1) ... [2021-07-06 20:25:15,052 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:15" (1/1) ... [2021-07-06 20:25:15,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:25:15,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:25:15,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:25:15,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:25:15,115 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:15" (1/1) ... [2021-07-06 20:25:15,115 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:15" (1/1) ... [2021-07-06 20:25:15,131 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:15" (1/1) ... [2021-07-06 20:25:15,136 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:15" (1/1) ... [2021-07-06 20:25:15,146 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:15" (1/1) ... [2021-07-06 20:25:15,153 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:15" (1/1) ... [2021-07-06 20:25:15,155 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:15" (1/1) ... [2021-07-06 20:25:15,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:25:15,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:25:15,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:25:15,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:25:15,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:15" (1/1) ... [2021-07-06 20:25:15,166 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:25:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:25:15,202 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:15,226 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:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:25:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:25:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:25:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:25:16,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:25:16,043 INFO L299 CfgBuilder]: Removed 198 assume(true) statements. [2021-07-06 20:25:16,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:16 BoogieIcfgContainer [2021-07-06 20:25:16,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:25:16,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:25:16,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:25:16,052 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:25:16,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:16,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:25:14" (1/3) ... [2021-07-06 20:25:16,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4038e363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:25:16, skipping insertion in model container [2021-07-06 20:25:16,054 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:16,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:25:15" (2/3) ... [2021-07-06 20:25:16,055 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4038e363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:25:16, skipping insertion in model container [2021-07-06 20:25:16,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:25:16,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:25:16" (3/3) ... [2021-07-06 20:25:16,056 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product45.cil.c [2021-07-06 20:25:16,096 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:25:16,096 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:25:16,096 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:25:16,096 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:25:16,097 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:25:16,097 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:25:16,097 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:25:16,097 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:25:16,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 131 states have internal predecessors, (198), 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:16,144 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2021-07-06 20:25:16,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:16,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:16,151 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:16,151 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:16,151 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:25:16,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 131 states have internal predecessors, (198), 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:16,155 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2021-07-06 20:25:16,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:16,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:16,156 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:16,156 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:25:16,159 INFO L791 eck$LassoCheckResult]: Stem: 94#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(80, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(117, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(109, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(112, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(110, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 2 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 3 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(32, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 2 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string40.base, #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 1 + #t~string40.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;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 15#L-1true havoc main_#res;havoc main_#t~ret20, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 57#L565true havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 59#L573true main_#t~ret20 := valid_product_#res;main_~tmp~1 := main_#t~ret20;havoc main_#t~ret20; 95#L267true assume 0 != main_~tmp~1; 53#L240true havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 55#L61-1true [2021-07-06 20:25:16,160 INFO L793 eck$LassoCheckResult]: Loop: 55#L61-1true assume !false; 127#L489true assume test_~splverifierCounter~0 < 4; 86#L490true test_~tmp~6 := test_#t~nondet42;havoc test_#t~nondet42; 96#L498true assume !(0 != test_~tmp~6); 98#L498-1true test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 21#L508true assume !(0 != test_~tmp___0~2); 24#L508-1true test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 60#L518true assume 0 != test_~tmp___2~0; 46#L524-2true assume !(0 != ~pumpRunning~0); 51#L290true assume !(0 != ~systemActive~0); 87#L297true havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 11#L128-3true __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 97#L55true assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 55#L61-1true [2021-07-06 20:25:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:25:16,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:16,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442416392] [2021-07-06 20:25:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:16,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:16,371 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:16,491 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:16,529 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1679313419, now seen corresponding path program 1 times [2021-07-06 20:25:16,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:16,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790797073] [2021-07-06 20:25:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:16,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:16,546 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:16,567 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:16,571 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:16,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash 34965519, now seen corresponding path program 1 times [2021-07-06 20:25:16,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:16,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102387285] [2021-07-06 20:25:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:16,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:16,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:16,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:16,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:16,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:16,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:16,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:16,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:16,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:25:16,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:16,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:16,710 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:16,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:16,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102387285] [2021-07-06 20:25:16,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102387285] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:16,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:16,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:25:16,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393187795] [2021-07-06 20:25:16,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:16,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-06 20:25:16,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:25:16,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:25:16,868 INFO L87 Difference]: Start difference. First operand has 132 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 131 states have internal predecessors, (198), 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:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:17,051 INFO L93 Difference]: Finished difference Result 132 states and 187 transitions. [2021-07-06 20:25:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 20:25:17,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 187 transitions. [2021-07-06 20:25:17,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2021-07-06 20:25:17,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 125 states and 180 transitions. [2021-07-06 20:25:17,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-07-06 20:25:17,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-07-06 20:25:17,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 180 transitions. [2021-07-06 20:25:17,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:17,065 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 180 transitions. [2021-07-06 20:25:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 180 transitions. [2021-07-06 20:25:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-07-06 20:25:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.44) internal successors, (180), 124 states have internal predecessors, (180), 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:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2021-07-06 20:25:17,095 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 180 transitions. [2021-07-06 20:25:17,095 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 180 transitions. [2021-07-06 20:25:17,095 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:25:17,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 180 transitions. [2021-07-06 20:25:17,097 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 83 [2021-07-06 20:25:17,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:17,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:17,098 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:17,098 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:17,098 INFO L791 eck$LassoCheckResult]: Stem: 388#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(80, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(117, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(109, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(112, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(110, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 2 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 3 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(32, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 2 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string40.base, #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 1 + #t~string40.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;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 302#L-1 havoc main_#res;havoc main_#t~ret20, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 303#L565 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 359#L573 main_#t~ret20 := valid_product_#res;main_~tmp~1 := main_#t~ret20;havoc main_#t~ret20; 360#L267 assume 0 != main_~tmp~1; 351#L240 havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 312#L61-1 [2021-07-06 20:25:17,099 INFO L793 eck$LassoCheckResult]: Loop: 312#L61-1 assume !false; 354#L489 assume test_~splverifierCounter~0 < 4; 384#L490 test_~tmp~6 := test_#t~nondet42;havoc test_#t~nondet42; 385#L498 assume !(0 != test_~tmp~6); 329#L498-1 test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 315#L508 assume !(0 != test_~tmp___0~2); 316#L508-1 test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 319#L518 assume 0 != test_~tmp___2~0; 344#L524-2 assume !(0 != ~pumpRunning~0); 345#L290 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 335#L348 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret21, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 336#L322-1 assume !(0 == ~pumpRunning~0); 308#L297 havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 298#L128-3 __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 299#L55 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 312#L61-1 [2021-07-06 20:25:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:17,099 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:25:17,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:17,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805634980] [2021-07-06 20:25:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:17,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,131 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,171 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:17,180 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1992761193, now seen corresponding path program 1 times [2021-07-06 20:25:17,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:17,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617582662] [2021-07-06 20:25:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:17,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:17,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:17,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:17,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:25:17,197 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:17,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:17,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617582662] [2021-07-06 20:25:17,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617582662] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:17,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:17,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:17,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850561662] [2021-07-06 20:25:17,199 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:25:17,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:17,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:25:17,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:25:17,201 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. cyclomatic complexity: 57 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:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:17,291 INFO L93 Difference]: Finished difference Result 172 states and 237 transitions. [2021-07-06 20:25:17,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:25:17,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 237 transitions. [2021-07-06 20:25:17,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 118 [2021-07-06 20:25:17,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 172 states and 237 transitions. [2021-07-06 20:25:17,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2021-07-06 20:25:17,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2021-07-06 20:25:17,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 237 transitions. [2021-07-06 20:25:17,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:17,312 INFO L681 BuchiCegarLoop]: Abstraction has 172 states and 237 transitions. [2021-07-06 20:25:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 237 transitions. [2021-07-06 20:25:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-07-06 20:25:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 172 states have (on average 1.377906976744186) internal successors, (237), 171 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:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 237 transitions. [2021-07-06 20:25:17,319 INFO L704 BuchiCegarLoop]: Abstraction has 172 states and 237 transitions. [2021-07-06 20:25:17,319 INFO L587 BuchiCegarLoop]: Abstraction has 172 states and 237 transitions. [2021-07-06 20:25:17,319 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:25:17,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 172 states and 237 transitions. [2021-07-06 20:25:17,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 118 [2021-07-06 20:25:17,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:17,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:17,323 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:17,324 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:17,324 INFO L791 eck$LassoCheckResult]: Stem: 697#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(80, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(117, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(109, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(112, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(110, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 2 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 3 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(32, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 2 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string40.base, #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 1 + #t~string40.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;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 606#L-1 havoc main_#res;havoc main_#t~ret20, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 607#L565 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 663#L573 main_#t~ret20 := valid_product_#res;main_~tmp~1 := main_#t~ret20;havoc main_#t~ret20; 664#L267 assume 0 != main_~tmp~1; 655#L240 havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 617#L61-1 [2021-07-06 20:25:17,324 INFO L793 eck$LassoCheckResult]: Loop: 617#L61-1 assume !false; 658#L489 assume test_~splverifierCounter~0 < 4; 693#L490 test_~tmp~6 := test_#t~nondet42;havoc test_#t~nondet42; 694#L498 assume !(0 != test_~tmp~6); 635#L498-1 test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 618#L508 assume !(0 != test_~tmp___0~2); 619#L508-1 test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 625#L518 assume 0 != test_~tmp___2~0; 650#L524-2 assume !(0 != ~pumpRunning~0); 651#L290 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 641#L348 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret21, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 642#L322-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret41, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 673#L168-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 674#L173-1 isHighWaterLevel_#t~ret41 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret41;havoc isHighWaterLevel_#t~ret41; 711#L467-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 715#L467-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 700#L473-1 processEnvironment__wrappee__methaneQuery_#t~ret21 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~2 := processEnvironment__wrappee__methaneQuery_#t~ret21;havoc processEnvironment__wrappee__methaneQuery_#t~ret21; 646#L326-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~2); 612#L297 havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 602#L128-3 __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 603#L55 assume 0 != __utac_acc__Specification3_spec__1_~tmp~0; 617#L61-1 [2021-07-06 20:25:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:25:17,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:17,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207186453] [2021-07-06 20:25:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:17,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,370 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,394 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:17,415 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash 790147587, now seen corresponding path program 1 times [2021-07-06 20:25:17,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:17,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304608966] [2021-07-06 20:25:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:17,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,421 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,424 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:17,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:17,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1246218781, now seen corresponding path program 1 times [2021-07-06 20:25:17,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:17,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966523781] [2021-07-06 20:25:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:17,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:25:17,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:17,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:17,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:25:17,471 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:17,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:25:17,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966523781] [2021-07-06 20:25:17,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966523781] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:25:17,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:25:17,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:25:17,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624150174] [2021-07-06 20:25:17,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:17,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 20:25:17,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:25:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:25:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:25:17,660 INFO L87 Difference]: Start difference. First operand 172 states and 237 transitions. cyclomatic complexity: 67 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:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:25:17,862 INFO L93 Difference]: Finished difference Result 574 states and 794 transitions. [2021-07-06 20:25:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:25:17,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574 states and 794 transitions. [2021-07-06 20:25:17,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 411 [2021-07-06 20:25:17,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574 states to 574 states and 794 transitions. [2021-07-06 20:25:17,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 574 [2021-07-06 20:25:17,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 574 [2021-07-06 20:25:17,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 574 states and 794 transitions. [2021-07-06 20:25:17,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:25:17,877 INFO L681 BuchiCegarLoop]: Abstraction has 574 states and 794 transitions. [2021-07-06 20:25:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states and 794 transitions. [2021-07-06 20:25:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 338. [2021-07-06 20:25:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.3609467455621302) internal successors, (460), 337 states have internal predecessors, (460), 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:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 460 transitions. [2021-07-06 20:25:17,928 INFO L704 BuchiCegarLoop]: Abstraction has 338 states and 460 transitions. [2021-07-06 20:25:17,929 INFO L587 BuchiCegarLoop]: Abstraction has 338 states and 460 transitions. [2021-07-06 20:25:17,930 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:25:17,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 460 transitions. [2021-07-06 20:25:17,932 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 236 [2021-07-06 20:25:17,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:25:17,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:25:17,933 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:25:17,933 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:17,933 INFO L791 eck$LassoCheckResult]: Stem: 1470#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~string11.base, #t~string11.offset := #Ultimate.allocOnStack(13);call #t~string13.base, #t~string13.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string13.base, #t~string13.offset, 1);call write~init~int(77, #t~string13.base, 1 + #t~string13.offset, 1);call write~init~int(101, #t~string13.base, 2 + #t~string13.offset, 1);call write~init~int(116, #t~string13.base, 3 + #t~string13.offset, 1);call write~init~int(104, #t~string13.base, 4 + #t~string13.offset, 1);call write~init~int(58, #t~string13.base, 5 + #t~string13.offset, 1);call write~init~int(0, #t~string13.base, 6 + #t~string13.offset, 1);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string15.base, #t~string15.offset, 1);call write~init~int(82, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(73, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(84, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 4 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string17.base, #t~string17.offset, 1);call write~init~int(75, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 2 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string19.base, #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 1 + #t~string19.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(13);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string28.base, #t~string28.offset, 1);call write~init~int(110, #t~string28.base, 1 + #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 2 + #t~string28.offset, 1);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string30.base, #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 1 + #t~string30.offset, 1);call write~init~int(102, #t~string30.base, 2 + #t~string30.offset, 1);call write~init~int(0, #t~string30.base, 3 + #t~string30.offset, 1);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string32.base, #t~string32.offset, 1);call write~init~int(80, #t~string32.base, 1 + #t~string32.offset, 1);call write~init~int(117, #t~string32.base, 2 + #t~string32.offset, 1);call write~init~int(109, #t~string32.base, 3 + #t~string32.offset, 1);call write~init~int(112, #t~string32.base, 4 + #t~string32.offset, 1);call write~init~int(58, #t~string32.base, 5 + #t~string32.offset, 1);call write~init~int(0, #t~string32.base, 6 + #t~string32.offset, 1);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string34.base, #t~string34.offset, 1);call write~init~int(110, #t~string34.base, 1 + #t~string34.offset, 1);call write~init~int(0, #t~string34.base, 2 + #t~string34.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string36.base, #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 1 + #t~string36.offset, 1);call write~init~int(102, #t~string36.base, 2 + #t~string36.offset, 1);call write~init~int(0, #t~string36.base, 3 + #t~string36.offset, 1);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string38.base, #t~string38.offset, 1);call write~init~int(32, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 2 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string40.base, #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 1 + #t~string40.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;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 1372#L-1 havoc main_#res;havoc main_#t~ret20, main_~retValue_acc~3, main_~tmp~1;havoc main_~retValue_acc~3;havoc main_~tmp~1; 1373#L565 havoc valid_product_#res;havoc valid_product_~retValue_acc~8;havoc valid_product_~retValue_acc~8;valid_product_~retValue_acc~8 := 1;valid_product_#res := valid_product_~retValue_acc~8; 1431#L573 main_#t~ret20 := valid_product_#res;main_~tmp~1 := main_#t~ret20;havoc main_#t~ret20; 1432#L267 assume 0 != main_~tmp~1; 1422#L240 havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1381#L61-1 [2021-07-06 20:25:17,933 INFO L793 eck$LassoCheckResult]: Loop: 1381#L61-1 assume !false; 1500#L489 assume test_~splverifierCounter~0 < 4; 1466#L490 test_~tmp~6 := test_#t~nondet42;havoc test_#t~nondet42; 1467#L498 assume !(0 != test_~tmp~6); 1402#L498-1 test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 1387#L508 assume !(0 != test_~tmp___0~2); 1388#L508-1 test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 1390#L518 assume 0 != test_~tmp___2~0; 1417#L524-2 assume !(0 != ~pumpRunning~0); 1418#L290 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1408#L348 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret21, processEnvironment__wrappee__methaneQuery_~tmp~2;havoc processEnvironment__wrappee__methaneQuery_~tmp~2; 1409#L322-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret41, isHighWaterLevel_~retValue_acc~6, isHighWaterLevel_~tmp~5, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~6;havoc isHighWaterLevel_~tmp~5;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~2;havoc isHighWaterSensorDry_~retValue_acc~2; 1441#L168-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~2 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~2; 1442#L173-1 isHighWaterLevel_#t~ret41 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~5 := isHighWaterLevel_#t~ret41;havoc isHighWaterLevel_#t~ret41; 1491#L467-3 assume 0 != isHighWaterLevel_~tmp~5;isHighWaterLevel_~tmp___0~1 := 0; 1496#L467-5 isHighWaterLevel_~retValue_acc~6 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~6; 1475#L473-1 processEnvironment__wrappee__methaneQuery_#t~ret21 := isHighWaterLevel_#res;processEnvironment__wrappee__methaneQuery_~tmp~2 := processEnvironment__wrappee__methaneQuery_#t~ret21;havoc processEnvironment__wrappee__methaneQuery_#t~ret21; 1476#L326-1 assume !(0 != processEnvironment__wrappee__methaneQuery_~tmp~2); 1464#L297 havoc __utac_acc__Specification3_spec__1_#t~ret7, __utac_acc__Specification3_spec__1_#t~ret8, __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_~tmp~0, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~0;havoc __utac_acc__Specification3_spec__1_~tmp___0~0;havoc __utac_acc__Specification3_spec__1_~tmp___1~0;havoc isMethaneLevelCritical_#res;havoc isMethaneLevelCritical_~retValue_acc~0;havoc isMethaneLevelCritical_~retValue_acc~0;isMethaneLevelCritical_~retValue_acc~0 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~0; 1465#L128-3 __utac_acc__Specification3_spec__1_#t~ret7 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~0 := __utac_acc__Specification3_spec__1_#t~ret7;havoc __utac_acc__Specification3_spec__1_#t~ret7; 1471#L55 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0);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; 1472#L160 __utac_acc__Specification3_spec__1_#t~ret8 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret8;havoc __utac_acc__Specification3_spec__1_#t~ret8; 1427#L61 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 1381#L61-1 [2021-07-06 20:25:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:25:17,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:17,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275719975] [2021-07-06 20:25:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:17,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:17,972 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:18,003 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:18,010 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash -877371915, now seen corresponding path program 1 times [2021-07-06 20:25:18,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:18,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928926646] [2021-07-06 20:25:18,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:18,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:18,016 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:18,019 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:18,022 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:25:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash -679618673, now seen corresponding path program 1 times [2021-07-06 20:25:18,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:25:18,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488974102] [2021-07-06 20:25:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:25:18,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:25:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:18,047 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:25:18,065 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:25:18,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:25:18,211 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-07-06 20:25:18,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:18,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-07-06 20:25:57,683 WARN L205 SmtUtils]: Spent 39.41 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:25:57,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:57,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:26:17,841 WARN L205 SmtUtils]: Spent 20.10 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:26:17,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:26:17 BoogieIcfgContainer [2021-07-06 20:26:17,970 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:26:17,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:26:17,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:26:17,971 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:26:17,972 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:16" (3/4) ... [2021-07-06 20:26:17,974 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:26:18,008 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:26:18,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:26:18,009 INFO L168 Benchmark]: Toolchain (without parser) took 63466.76 ms. Allocated memory was 60.8 MB in the beginning and 113.2 MB in the end (delta: 52.4 MB). Free memory was 37.6 MB in the beginning and 80.4 MB in the end (delta: -42.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:18,009 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 60.8 MB. Free memory is still 41.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:26:18,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.15 ms. Allocated memory is still 60.8 MB. Free memory was 37.4 MB in the beginning and 33.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:18,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.76 ms. Allocated memory is still 60.8 MB. Free memory was 33.3 MB in the beginning and 29.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:18,019 INFO L168 Benchmark]: Boogie Preprocessor took 51.81 ms. Allocated memory is still 60.8 MB. Free memory was 29.5 MB in the beginning and 26.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:18,019 INFO L168 Benchmark]: RCFGBuilder took 888.84 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 26.6 MB in the beginning and 52.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:18,020 INFO L168 Benchmark]: BuchiAutomizer took 61920.82 ms. Allocated memory was 73.4 MB in the beginning and 113.2 MB in the end (delta: 39.8 MB). Free memory was 52.6 MB in the beginning and 82.5 MB in the end (delta: -29.9 MB). Peak memory consumption was 75.4 MB. Max. memory is 16.1 GB. [2021-07-06 20:26:18,020 INFO L168 Benchmark]: Witness Printer took 37.39 ms. Allocated memory is still 113.2 MB. Free memory was 82.5 MB in the beginning and 80.4 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:26:18,021 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.19 ms. Allocated memory is still 60.8 MB. Free memory is still 41.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 480.15 ms. Allocated memory is still 60.8 MB. Free memory was 37.4 MB in the beginning and 33.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.76 ms. Allocated memory is still 60.8 MB. Free memory was 33.3 MB in the beginning and 29.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.81 ms. Allocated memory is still 60.8 MB. Free memory was 29.5 MB in the beginning and 26.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 888.84 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 26.6 MB in the beginning and 52.6 MB in the end (delta: -26.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 61920.82 ms. Allocated memory was 73.4 MB in the beginning and 113.2 MB in the end (delta: 39.8 MB). Free memory was 52.6 MB in the beginning and 82.5 MB in the end (delta: -29.9 MB). Peak memory consumption was 75.4 MB. Max. memory is 16.1 GB. * Witness Printer took 37.39 ms. Allocated memory is still 113.2 MB. Free memory was 82.5 MB in the beginning and 80.4 MB in the end (delta: 2.1 MB). There was no memory consumed. 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 338 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 61.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 61.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 76.8ms AutomataMinimizationTime, 3 MinimizatonAttempts, 236 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 338 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 590 SDtfs, 1550 SDslu, 823 SDs, 0 SdLazy, 169 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 299.6ms 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: 488]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9141} State at position 1 is {NULL=0, NULL=9141, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@382134ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@783bc7bd=53, NULL=10310, NULL=9142, methaneLevelCritical=0, NULL=0, tmp=0, NULL=10305, NULL=0, tmp___1=0, retValue_acc=0, NULL=0, NULL=9146, tmp=0, cleanupTimeShifts=4, NULL=10302, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6079ea96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c2dceea=0, waterLevel=1, NULL=0, NULL=0, \result=1, retValue_acc=1, head=0, pumpRunning=0, NULL=10319, NULL=0, tmp=1, retValue_acc=1, NULL=0, NULL=0, \result=1, NULL=0, NULL=0, NULL=0, NULL=10316, NULL=0, NULL=0, NULL=0, tmp___0=0, tmp=1, NULL=10322, NULL=10308, NULL=10313, tmp=0, head=0, NULL=0, NULL=0, NULL=10306, NULL=10307, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@262a8d00=0, tmp=0, NULL=10321, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68e6ef3b=0, retValue_acc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8c4f63f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78376dd1=0, NULL=10315, tmp___0=0, NULL=0, NULL=0, NULL=10311, NULL=0, NULL=0, tmp___0=1, NULL=9148, NULL=10320, NULL=0, systemActive=1, NULL=10309, \result=1, NULL=0, \result=0, NULL=9143, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b89e8d=0, \result=0, NULL=0, NULL=10318, NULL=0, NULL=0, NULL=10304, retValue_acc=1, NULL=10312, NULL=10314, tmp___2=53, splverifierCounter=0, NULL=0, \result=0, NULL=9144, NULL=10317, tmp___1=0, NULL=9145, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@407873e2=0, NULL=10303, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c354b56=0, NULL=0, NULL=9147} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L85] int waterLevel = 1; [L86] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L283] int pumpRunning = 0; [L284] int systemActive = 1; [L756] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L258] int retValue_acc ; [L259] int tmp ; [L569] int retValue_acc ; [L572] retValue_acc = 1 [L573] return (retValue_acc); [L265] tmp = valid_product() [L267] COND TRUE \read(tmp) [L479] int splverifierCounter ; [L480] int tmp ; [L481] int tmp___0 ; [L482] int tmp___1 ; [L483] int tmp___2 ; [L486] splverifierCounter = 0 Loop: [L488] COND TRUE 1 [L490] COND TRUE splverifierCounter < 4 [L496] tmp = __VERIFIER_nondet_int() [L498] COND FALSE !(\read(tmp)) [L506] tmp___0 = __VERIFIER_nondet_int() [L508] COND FALSE !(\read(tmp___0)) [L516] tmp___2 = __VERIFIER_nondet_int() [L518] COND TRUE \read(tmp___2) [L290] COND FALSE !(\read(pumpRunning)) [L297] COND TRUE \read(systemActive) [L345] int tmp ; [L348] COND FALSE !(\read(pumpRunning)) [L319] int tmp ; [L322] COND TRUE ! pumpRunning [L459] int retValue_acc ; [L460] int tmp ; [L461] int tmp___0 ; [L165] int retValue_acc ; [L168] COND TRUE waterLevel < 2 [L169] retValue_acc = 1 [L170] return (retValue_acc); [L465] tmp = isHighWaterSensorDry() [L467] COND TRUE \read(tmp) [L468] tmp___0 = 0 [L472] retValue_acc = tmp___0 [L473] return (retValue_acc); [L324] tmp = isHighWaterLevel() [L326] COND FALSE !(\read(tmp)) [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); [L53] tmp = isMethaneLevelCritical() [L55] COND FALSE !(\read(tmp)) [L156] int retValue_acc ; [L159] retValue_acc = waterLevel [L160] return (retValue_acc); [L59] tmp___0 = getWaterLevel() [L61] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:26:18,082 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...