./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product40.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_product40.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 808e109e6e5bbd4457b727764ccf6e4076a38ae9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:24:46,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:24:46,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:24:46,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:24:46,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:24:46,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:24:46,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:24:46,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:24:46,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:24:46,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:24:46,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:24:46,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:24:46,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:24:46,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:24:46,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:24:46,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:24:46,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:24:46,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:24:46,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:24:46,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:24:46,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:24:46,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:24:46,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:24:46,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:24:46,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:24:46,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:24:46,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:24:46,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:24:46,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:24:46,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:24:46,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:24:46,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:24:46,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:24:46,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:24:46,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:24:46,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:24:46,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:24:46,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:24:46,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:24:46,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:24:46,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:24:46,879 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:24:46,916 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:24:46,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:24:46,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:24:46,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:24:46,919 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:24:46,919 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:24:46,919 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:24:46,920 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:24:46,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:24:46,921 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:24:46,921 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:24:46,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:24:46,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:24:46,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:24:46,923 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:24:46,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:24:46,923 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:24:46,923 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:24:46,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:24:46,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:24:46,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:24:46,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:24:46,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:24:46,924 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:24:46,925 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:24:46,925 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 -> 808e109e6e5bbd4457b727764ccf6e4076a38ae9 [2021-07-06 20:24:47,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:24:47,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:24:47,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:24:47,215 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:24:47,216 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:24:47,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product40.cil.c [2021-07-06 20:24:47,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73efe9fd/c6e617b7452d467ab0d2d6434d9f27f6/FLAG94cdf7683 [2021-07-06 20:24:47,682 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:24:47,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product40.cil.c [2021-07-06 20:24:47,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73efe9fd/c6e617b7452d467ab0d2d6434d9f27f6/FLAG94cdf7683 [2021-07-06 20:24:47,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73efe9fd/c6e617b7452d467ab0d2d6434d9f27f6 [2021-07-06 20:24:47,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:24:47,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:24:47,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:24:47,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:24:47,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:24:47,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:47" (1/1) ... [2021-07-06 20:24:47,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5ee3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:47, skipping insertion in model container [2021-07-06 20:24:47,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:24:47" (1/1) ... [2021-07-06 20:24:47,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:24:47,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:24:47,952 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_product40.cil.c[3612,3625] [2021-07-06 20:24:48,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:24:48,058 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:24:48,070 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_product40.cil.c[3612,3625] [2021-07-06 20:24:48,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:24:48,119 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:24:48,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48 WrapperNode [2021-07-06 20:24:48,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:24:48,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:24:48,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:24:48,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:24:48,125 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:24:48" (1/1) ... [2021-07-06 20:24:48,135 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:24:48" (1/1) ... [2021-07-06 20:24:48,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:24:48,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:24:48,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:24:48,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:24:48,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:24:48,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:24:48,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:24:48,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:24:48,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (1/1) ... [2021-07-06 20:24:48,220 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:24:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:24:48,262 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:24:48,287 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:24:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:24:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:24:48,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:24:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:24:49,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:24:49,045 INFO L299 CfgBuilder]: Removed 168 assume(true) statements. [2021-07-06 20:24:49,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:49 BoogieIcfgContainer [2021-07-06 20:24:49,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:24:49,047 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:24:49,047 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:24:49,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:24:49,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:49,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:24:47" (1/3) ... [2021-07-06 20:24:49,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46ce73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:49, skipping insertion in model container [2021-07-06 20:24:49,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:49,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:24:48" (2/3) ... [2021-07-06 20:24:49,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46ce73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:24:49, skipping insertion in model container [2021-07-06 20:24:49,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:24:49,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:49" (3/3) ... [2021-07-06 20:24:49,051 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec3_product40.cil.c [2021-07-06 20:24:49,083 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:24:49,083 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:24:49,083 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:24:49,083 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:24:49,084 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:24:49,084 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:24:49,084 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:24:49,084 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:24:49,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 115 states have internal predecessors, (177), 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:24:49,118 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2021-07-06 20:24:49,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:49,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:49,123 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:49,123 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:49,124 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:24:49,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 115 states have internal predecessors, (177), 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:24:49,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2021-07-06 20:24:49,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:49,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:49,137 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:49,137 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:24:49,150 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~string13.base, #t~string13.offset := #Ultimate.allocOnStack(13);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(77, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(101, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(116, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(104, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string17.base, #t~string17.offset, 1);call write~init~int(82, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(73, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(84, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 4 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(75, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.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~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 14#L-1true havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 72#L168true havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 88#L176true main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 101#L132true assume 0 != main_~tmp~0; 47#L105true havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 110#L200-1true [2021-07-06 20:24:49,150 INFO L793 eck$LassoCheckResult]: Loop: 110#L200-1true assume !false; 15#L541true assume test_~splverifierCounter~0 < 4; 92#L542true test_~tmp~5 := test_#t~nondet42;havoc test_#t~nondet42; 104#L550true assume !(0 != test_~tmp~5); 105#L550-1true test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 26#L560true assume !(0 != test_~tmp___0~2); 28#L560-1true test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 84#L570true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 90#L578-1true assume !(0 != ~pumpRunning~0); 83#L336true assume !(0 != ~systemActive~0); 8#L343true havoc __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_#t~ret11, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 7#L274-1true __utac_acc__Specification3_spec__1_#t~ret9 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret9;havoc __utac_acc__Specification3_spec__1_#t~ret9; 24#L194true assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 110#L200-1true [2021-07-06 20:24:49,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:24:49,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:49,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597814960] [2021-07-06 20:24:49,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:49,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:49,422 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:49,494 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:49,531 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1670447617, now seen corresponding path program 1 times [2021-07-06 20:24:49,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:49,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825875378] [2021-07-06 20:24:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:49,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:49,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:49,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:49,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:49,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:49,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:49,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:49,592 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:24:49,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:49,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825875378] [2021-07-06 20:24:49,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825875378] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:49,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:49,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:49,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142973323] [2021-07-06 20:24:49,597 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:24:49,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:49,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:24:49,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:24:49,609 INFO L87 Difference]: Start difference. First operand has 116 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 115 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:24:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:49,662 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2021-07-06 20:24:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:24:49,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 330 transitions. [2021-07-06 20:24:49,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2021-07-06 20:24:49,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 212 states and 315 transitions. [2021-07-06 20:24:49,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2021-07-06 20:24:49,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2021-07-06 20:24:49,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 315 transitions. [2021-07-06 20:24:49,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:49,680 INFO L681 BuchiCegarLoop]: Abstraction has 212 states and 315 transitions. [2021-07-06 20:24:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 315 transitions. [2021-07-06 20:24:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2021-07-06 20:24:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 210 states have (on average 1.4857142857142858) internal successors, (312), 209 states have internal predecessors, (312), 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:24:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 312 transitions. [2021-07-06 20:24:49,715 INFO L704 BuchiCegarLoop]: Abstraction has 210 states and 312 transitions. [2021-07-06 20:24:49,715 INFO L587 BuchiCegarLoop]: Abstraction has 210 states and 312 transitions. [2021-07-06 20:24:49,715 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:24:49,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 312 transitions. [2021-07-06 20:24:49,718 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 144 [2021-07-06 20:24:49,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:49,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:49,719 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:49,719 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:24:49,719 INFO L791 eck$LassoCheckResult]: Stem: 466#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~string13.base, #t~string13.offset := #Ultimate.allocOnStack(13);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(77, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(101, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(116, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(104, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string17.base, #t~string17.offset, 1);call write~init~int(82, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(73, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(84, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 4 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(75, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.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~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 372#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 373#L168 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 452#L176 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 464#L132 assume 0 != main_~tmp~0; 428#L105 havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 393#L200-1 [2021-07-06 20:24:49,719 INFO L793 eck$LassoCheckResult]: Loop: 393#L200-1 assume !false; 374#L541 assume test_~splverifierCounter~0 < 4; 375#L542 test_~tmp~5 := test_#t~nondet42;havoc test_#t~nondet42; 465#L550 assume !(0 != test_~tmp~5); 401#L550-1 test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 397#L560 assume !(0 != test_~tmp___0~2); 398#L560-1 test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 402#L570 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 460#L578-1 assume !(0 != ~pumpRunning~0); 459#L336 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret23, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 455#L394 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret22, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 456#L368-1 assume !(0 == ~pumpRunning~0); 354#L343 havoc __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_#t~ret11, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 361#L274-1 __utac_acc__Specification3_spec__1_#t~ret9 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret9;havoc __utac_acc__Specification3_spec__1_#t~ret9; 362#L194 assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 393#L200-1 [2021-07-06 20:24:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:24:49,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:49,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055599093] [2021-07-06 20:24:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:49,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:49,777 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:49,818 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:49,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1422660394, now seen corresponding path program 1 times [2021-07-06 20:24:49,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:49,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752154615] [2021-07-06 20:24:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:49,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:49,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:49,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:49,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:49,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:49,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:49,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:24:49,857 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:24:49,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:49,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752154615] [2021-07-06 20:24:49,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752154615] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:49,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:49,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:49,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535399811] [2021-07-06 20:24:49,859 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:24:49,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:24:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:24:49,861 INFO L87 Difference]: Start difference. First operand 210 states and 312 transitions. cyclomatic complexity: 105 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:24:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:49,944 INFO L93 Difference]: Finished difference Result 305 states and 430 transitions. [2021-07-06 20:24:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:24:49,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 305 states and 430 transitions. [2021-07-06 20:24:49,947 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 215 [2021-07-06 20:24:49,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 305 states to 305 states and 430 transitions. [2021-07-06 20:24:49,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2021-07-06 20:24:49,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2021-07-06 20:24:49,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 305 states and 430 transitions. [2021-07-06 20:24:49,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:49,955 INFO L681 BuchiCegarLoop]: Abstraction has 305 states and 430 transitions. [2021-07-06 20:24:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states and 430 transitions. [2021-07-06 20:24:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2021-07-06 20:24:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 305 states have (on average 1.4098360655737705) internal successors, (430), 304 states have internal predecessors, (430), 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:24:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 430 transitions. [2021-07-06 20:24:49,963 INFO L704 BuchiCegarLoop]: Abstraction has 305 states and 430 transitions. [2021-07-06 20:24:49,963 INFO L587 BuchiCegarLoop]: Abstraction has 305 states and 430 transitions. [2021-07-06 20:24:49,963 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:24:49,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 430 transitions. [2021-07-06 20:24:49,965 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 215 [2021-07-06 20:24:49,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:49,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:49,966 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:49,967 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:24:49,967 INFO L791 eck$LassoCheckResult]: Stem: 1001#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~string13.base, #t~string13.offset := #Ultimate.allocOnStack(13);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(77, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(101, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(116, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(104, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string17.base, #t~string17.offset, 1);call write~init~int(82, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(73, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(84, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 4 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(75, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.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~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 896#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 897#L168 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 980#L176 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 997#L132 assume 0 != main_~tmp~0; 952#L105 havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 953#L200-1 [2021-07-06 20:24:49,967 INFO L793 eck$LassoCheckResult]: Loop: 953#L200-1 assume !false; 1010#L541 assume test_~splverifierCounter~0 < 4; 1076#L542 test_~tmp~5 := test_#t~nondet42;havoc test_#t~nondet42; 1075#L550 assume !(0 != test_~tmp~5); 1073#L550-1 test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 1072#L560 assume !(0 != test_~tmp___0~2); 925#L560-1 test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 926#L570 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 992#L578-1 assume !(0 != ~pumpRunning~0); 1028#L336 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret23, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 1068#L394 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret22, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 1023#L368-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret41, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 1067#L314-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 1000#L319-1 isHighWaterLevel_#t~ret41 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret41;havoc isHighWaterLevel_#t~ret41; 945#L496-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 946#L496-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 934#L502-1 processEnvironment__wrappee__highWaterSensor_#t~ret22 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret22;havoc processEnvironment__wrappee__highWaterSensor_#t~ret22; 935#L372-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 875#L343 havoc __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_#t~ret11, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 884#L274-1 __utac_acc__Specification3_spec__1_#t~ret9 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret9;havoc __utac_acc__Specification3_spec__1_#t~ret9; 1078#L194 assume 0 != __utac_acc__Specification3_spec__1_~tmp~1; 953#L200-1 [2021-07-06 20:24:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:49,968 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:24:49,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:49,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714666929] [2021-07-06 20:24:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:49,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:49,997 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,041 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,056 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash 287627938, now seen corresponding path program 1 times [2021-07-06 20:24:50,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:50,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792342387] [2021-07-06 20:24:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:50,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,074 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,076 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,078 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 743699132, now seen corresponding path program 1 times [2021-07-06 20:24:50,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:50,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280083076] [2021-07-06 20:24:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:50,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:24:50,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:50,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:50,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:50,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:50,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:50,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:24:50,115 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:24:50,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:24:50,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280083076] [2021-07-06 20:24:50,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280083076] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:24:50,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:24:50,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:24:50,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595204821] [2021-07-06 20:24:50,224 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2021-07-06 20:24:50,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:50,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-06 20:24:50,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:24:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:24:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:24:50,269 INFO L87 Difference]: Start difference. First operand 305 states and 430 transitions. cyclomatic complexity: 128 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:24:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:24:50,355 INFO L93 Difference]: Finished difference Result 1017 states and 1438 transitions. [2021-07-06 20:24:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-06 20:24:50,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1017 states and 1438 transitions. [2021-07-06 20:24:50,361 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 762 [2021-07-06 20:24:50,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1017 states to 1017 states and 1438 transitions. [2021-07-06 20:24:50,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1017 [2021-07-06 20:24:50,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1017 [2021-07-06 20:24:50,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1017 states and 1438 transitions. [2021-07-06 20:24:50,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:24:50,368 INFO L681 BuchiCegarLoop]: Abstraction has 1017 states and 1438 transitions. [2021-07-06 20:24:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states and 1438 transitions. [2021-07-06 20:24:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 604. [2021-07-06 20:24:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 604 states have (on average 1.3874172185430464) internal successors, (838), 603 states have internal predecessors, (838), 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:24:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 838 transitions. [2021-07-06 20:24:50,380 INFO L704 BuchiCegarLoop]: Abstraction has 604 states and 838 transitions. [2021-07-06 20:24:50,381 INFO L587 BuchiCegarLoop]: Abstraction has 604 states and 838 transitions. [2021-07-06 20:24:50,381 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-07-06 20:24:50,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 604 states and 838 transitions. [2021-07-06 20:24:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 430 [2021-07-06 20:24:50,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:24:50,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:24:50,383 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:24:50,384 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:24:50,384 INFO L791 eck$LassoCheckResult]: Stem: 2350#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~string13.base, #t~string13.offset := #Ultimate.allocOnStack(13);call #t~string15.base, #t~string15.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string15.base, #t~string15.offset, 1);call write~init~int(77, #t~string15.base, 1 + #t~string15.offset, 1);call write~init~int(101, #t~string15.base, 2 + #t~string15.offset, 1);call write~init~int(116, #t~string15.base, 3 + #t~string15.offset, 1);call write~init~int(104, #t~string15.base, 4 + #t~string15.offset, 1);call write~init~int(58, #t~string15.base, 5 + #t~string15.offset, 1);call write~init~int(0, #t~string15.base, 6 + #t~string15.offset, 1);call #t~string17.base, #t~string17.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string17.base, #t~string17.offset, 1);call write~init~int(82, #t~string17.base, 1 + #t~string17.offset, 1);call write~init~int(73, #t~string17.base, 2 + #t~string17.offset, 1);call write~init~int(84, #t~string17.base, 3 + #t~string17.offset, 1);call write~init~int(0, #t~string17.base, 4 + #t~string17.offset, 1);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string19.base, #t~string19.offset, 1);call write~init~int(75, #t~string19.base, 1 + #t~string19.offset, 1);call write~init~int(0, #t~string19.base, 2 + #t~string19.offset, 1);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string21.base, #t~string21.offset, 1);call write~init~int(0, #t~string21.base, 1 + #t~string21.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~string64.base, #t~string64.offset := #Ultimate.allocOnStack(30);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(9);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(21);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(30);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(9);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(21);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(30);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(9);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(25);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(30);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(9);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0; 2237#L-1 havoc main_#res;havoc main_#t~ret7, main_~retValue_acc~0, main_~tmp~0;havoc main_~retValue_acc~0;havoc main_~tmp~0; 2238#L168 havoc valid_product_#res;havoc valid_product_~retValue_acc~2;havoc valid_product_~retValue_acc~2;valid_product_~retValue_acc~2 := 1;valid_product_#res := valid_product_~retValue_acc~2; 2325#L176 main_#t~ret7 := valid_product_#res;main_~tmp~0 := main_#t~ret7;havoc main_#t~ret7; 2345#L132 assume 0 != main_~tmp~0; 2294#L105 havoc test_#t~nondet42, test_#t~nondet43, test_#t~nondet44, test_#t~nondet45, test_~splverifierCounter~0, test_~tmp~5, test_~tmp___0~2, test_~tmp___1~1, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~5;havoc test_~tmp___0~2;havoc test_~tmp___1~1;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 2295#L200-1 [2021-07-06 20:24:50,384 INFO L793 eck$LassoCheckResult]: Loop: 2295#L200-1 assume !false; 2239#L541 assume test_~splverifierCounter~0 < 4; 2240#L542 test_~tmp~5 := test_#t~nondet42;havoc test_#t~nondet42; 2349#L550 assume !(0 != test_~tmp~5); 2264#L550-1 test_~tmp___0~2 := test_#t~nondet43;havoc test_#t~nondet43; 2260#L560 assume !(0 != test_~tmp___0~2); 2261#L560-1 test_~tmp___2~0 := test_#t~nondet44;havoc test_#t~nondet44; 2341#L570 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 2342#L578-1 assume !(0 != ~pumpRunning~0); 2811#L336 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret23, processEnvironment_~tmp~3;havoc processEnvironment_~tmp~3; 2812#L394 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret22, processEnvironment__wrappee__highWaterSensor_~tmp~2;havoc processEnvironment__wrappee__highWaterSensor_~tmp~2; 2803#L368-1 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret41, isHighWaterLevel_~retValue_acc~8, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~1;havoc isHighWaterLevel_~retValue_acc~8;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~1;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~5;havoc isHighWaterSensorDry_~retValue_acc~5; 2808#L314-1 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~5 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~5; 2806#L319-1 isHighWaterLevel_#t~ret41 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret41;havoc isHighWaterLevel_#t~ret41; 2805#L496-3 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~1 := 0; 2804#L496-5 isHighWaterLevel_~retValue_acc~8 := isHighWaterLevel_~tmp___0~1;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~8; 2801#L502-1 processEnvironment__wrappee__highWaterSensor_#t~ret22 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~2 := processEnvironment__wrappee__highWaterSensor_#t~ret22;havoc processEnvironment__wrappee__highWaterSensor_#t~ret22; 2792#L372-1 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~2); 2224#L343 havoc __utac_acc__Specification3_spec__1_#t~ret9, __utac_acc__Specification3_spec__1_#t~ret10, __utac_acc__Specification3_spec__1_#t~ret11, __utac_acc__Specification3_spec__1_~tmp~1, __utac_acc__Specification3_spec__1_~tmp___0~0, __utac_acc__Specification3_spec__1_~tmp___1~0;havoc __utac_acc__Specification3_spec__1_~tmp~1;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~3;havoc isMethaneLevelCritical_~retValue_acc~3;isMethaneLevelCritical_~retValue_acc~3 := ~methaneLevelCritical~0;isMethaneLevelCritical_#res := isMethaneLevelCritical_~retValue_acc~3; 2225#L274-1 __utac_acc__Specification3_spec__1_#t~ret9 := isMethaneLevelCritical_#res;__utac_acc__Specification3_spec__1_~tmp~1 := __utac_acc__Specification3_spec__1_#t~ret9;havoc __utac_acc__Specification3_spec__1_#t~ret9; 2258#L194 assume !(0 != __utac_acc__Specification3_spec__1_~tmp~1);havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~4;havoc getWaterLevel_~retValue_acc~4;getWaterLevel_~retValue_acc~4 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~4; 2259#L306 __utac_acc__Specification3_spec__1_#t~ret10 := getWaterLevel_#res;__utac_acc__Specification3_spec__1_~tmp___0~0 := __utac_acc__Specification3_spec__1_#t~ret10;havoc __utac_acc__Specification3_spec__1_#t~ret10; 2362#L200 assume !(2 == __utac_acc__Specification3_spec__1_~tmp___0~0); 2295#L200-1 [2021-07-06 20:24:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 4 times [2021-07-06 20:24:50,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:50,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127520886] [2021-07-06 20:24:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:50,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,416 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,444 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,449 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1532549460, now seen corresponding path program 1 times [2021-07-06 20:24:50,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:50,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499308829] [2021-07-06 20:24:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:50,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,454 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,456 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,458 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:24:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1730302702, now seen corresponding path program 1 times [2021-07-06 20:24:50,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:24:50,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329292206] [2021-07-06 20:24:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:24:50,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:24:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,487 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:24:50,526 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:24:50,536 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:24:50,650 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-07-06 20:24:50,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:24:50,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-06 20:25:35,865 WARN L205 SmtUtils]: Spent 45.16 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:25:35,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:25:35,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:25:58,143 WARN L205 SmtUtils]: Spent 22.24 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:25:58,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:25:58 BoogieIcfgContainer [2021-07-06 20:25:58,274 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:25:58,274 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:25:58,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:25:58,275 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:25:58,275 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:24:49" (3/4) ... [2021-07-06 20:25:58,277 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:25:58,304 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:25:58,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:25:58,305 INFO L168 Benchmark]: Toolchain (without parser) took 70589.41 ms. Allocated memory was 54.5 MB in the beginning and 123.7 MB in the end (delta: 69.2 MB). Free memory was 30.6 MB in the beginning and 81.0 MB in the end (delta: -50.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,306 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 35.5 MB in the beginning and 35.5 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:25:58,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.09 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 30.5 MB in the beginning and 45.6 MB in the end (delta: -15.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.81 ms. Allocated memory is still 73.4 MB. Free memory was 45.6 MB in the beginning and 42.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,307 INFO L168 Benchmark]: Boogie Preprocessor took 37.20 ms. Allocated memory is still 73.4 MB. Free memory was 42.0 MB in the beginning and 39.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,307 INFO L168 Benchmark]: RCFGBuilder took 831.63 ms. Allocated memory is still 73.4 MB. Free memory was 55.3 MB in the beginning and 41.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,307 INFO L168 Benchmark]: BuchiAutomizer took 69227.56 ms. Allocated memory was 73.4 MB in the beginning and 123.7 MB in the end (delta: 50.3 MB). Free memory was 41.1 MB in the beginning and 83.9 MB in the end (delta: -42.8 MB). Peak memory consumption was 73.4 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,307 INFO L168 Benchmark]: Witness Printer took 30.26 ms. Allocated memory is still 123.7 MB. Free memory was 83.1 MB in the beginning and 81.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:25:58,309 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.14 ms. Allocated memory is still 54.5 MB. Free memory was 35.5 MB in the beginning and 35.5 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 402.09 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 30.5 MB in the beginning and 45.6 MB in the end (delta: -15.2 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.81 ms. Allocated memory is still 73.4 MB. Free memory was 45.6 MB in the beginning and 42.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.20 ms. Allocated memory is still 73.4 MB. Free memory was 42.0 MB in the beginning and 39.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 831.63 ms. Allocated memory is still 73.4 MB. Free memory was 55.3 MB in the beginning and 41.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 69227.56 ms. Allocated memory was 73.4 MB in the beginning and 123.7 MB in the end (delta: 50.3 MB). Free memory was 41.1 MB in the beginning and 83.9 MB in the end (delta: -42.8 MB). Peak memory consumption was 73.4 MB. Max. memory is 16.1 GB. * Witness Printer took 30.26 ms. Allocated memory is still 123.7 MB. Free memory was 83.1 MB in the beginning and 81.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 604 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 68.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 47.6ms AutomataMinimizationTime, 3 MinimizatonAttempts, 415 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 604 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 560 SDtfs, 913 SDslu, 934 SDs, 0 SdLazy, 110 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 117.7ms Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 540]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=15087} State at position 1 is {NULL=0, NULL=0, NULL=15087, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a938e0d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@888d60c=68, NULL=15091, NULL=46092, methaneLevelCritical=0, tmp=0, NULL=0, retValue_acc=0, NULL=46073, NULL=0, tmp___1=0, NULL=0, NULL=46087, tmp=0, cleanupTimeShifts=4, NULL=46072, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2d31b949=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b722de7=0, waterLevel=1, NULL=0, NULL=0, \result=1, head=0, pumpRunning=0, tmp=1, retValue_acc=1, NULL=46086, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f73db29=0, NULL=0, \result=1, NULL=0, tmp=1, NULL=0, NULL=46071, NULL=0, NULL=0, NULL=0, NULL=0, tmp___0=0, retValue_acc=1, NULL=46079, NULL=46078, NULL=46074, NULL=46084, tmp=0, head=0, NULL=0, NULL=0, NULL=46094, NULL=46082, NULL=46083, retValue_acc=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d2ac883=0, NULL=15090, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f9baaf6=0, tmp___0=0, NULL=0, NULL=0, NULL=15089, NULL=0, NULL=0, tmp___0=1, NULL=46075, NULL=46093, tmp=0, NULL=0, NULL=0, systemActive=1, NULL=46077, \result=1, NULL=0, retValue_acc=0, \result=0, NULL=46081, \result=0, NULL=15088, NULL=0, NULL=46076, NULL=0, NULL=0, NULL=46080, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12345ce6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5bf137a3=0, NULL=46090, retValue_acc=1, tmp___2=68, splverifierCounter=0, NULL=0, \result=0, NULL=46091, tmp___1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45867bd9=0, NULL=46089, NULL=46085, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32dda60=0, NULL=46088} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L42] int cleanupTimeShifts = 4; [L231] int waterLevel = 1; [L232] int methaneLevelCritical = 0; [L329] int pumpRunning = 0; [L330] int systemActive = 1; [L768] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L123] int retValue_acc ; [L124] int tmp ; [L172] int retValue_acc ; [L175] retValue_acc = 1 [L176] return (retValue_acc); [L130] tmp = valid_product() [L132] COND TRUE \read(tmp) [L531] int splverifierCounter ; [L532] int tmp ; [L533] int tmp___0 ; [L534] int tmp___1 ; [L535] int tmp___2 ; [L538] splverifierCounter = 0 Loop: [L540] COND TRUE 1 [L542] COND TRUE splverifierCounter < 4 [L548] tmp = __VERIFIER_nondet_int() [L550] COND FALSE !(\read(tmp)) [L558] tmp___0 = __VERIFIER_nondet_int() [L560] COND FALSE !(\read(tmp___0)) [L568] tmp___2 = __VERIFIER_nondet_int() [L570] COND TRUE \read(tmp___2) [L525] systemActive = 1 [L336] COND FALSE !(\read(pumpRunning)) [L343] COND TRUE \read(systemActive) [L391] int tmp ; [L394] COND FALSE !(\read(pumpRunning)) [L365] int tmp ; [L368] COND TRUE ! pumpRunning [L488] int retValue_acc ; [L489] int tmp ; [L490] int tmp___0 ; [L311] int retValue_acc ; [L314] COND TRUE waterLevel < 2 [L315] retValue_acc = 1 [L316] return (retValue_acc); [L494] tmp = isHighWaterSensorDry() [L496] COND TRUE \read(tmp) [L497] tmp___0 = 0 [L501] retValue_acc = tmp___0 [L502] return (retValue_acc); [L370] tmp = isHighWaterLevel() [L372] COND FALSE !(\read(tmp)) [L186] int tmp ; [L187] int tmp___0 ; [L188] int tmp___1 ; [L270] int retValue_acc ; [L273] retValue_acc = methaneLevelCritical [L274] return (retValue_acc); [L192] tmp = isMethaneLevelCritical() [L194] COND FALSE !(\read(tmp)) [L302] int retValue_acc ; [L305] retValue_acc = waterLevel [L306] return (retValue_acc); [L198] tmp___0 = getWaterLevel() [L200] COND FALSE !(tmp___0 == 2) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:25:58,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...