./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product61.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_spec4_product61.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 a1351cae46a0bf53747c47a3bd817fbc84c54eae ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31:45,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:31:45,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:31:45,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:31:45,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:31:46,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:31:46,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:31:46,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:31:46,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:31:46,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:31:46,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:31:46,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:31:46,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:31:46,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:31:46,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:31:46,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:31:46,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:31:46,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:31:46,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:31:46,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:31:46,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:31:46,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:31:46,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:31:46,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:31:46,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:31:46,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:31:46,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:31:46,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:31:46,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:31:46,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:31:46,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:31:46,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:31:46,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:31:46,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:31:46,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:31:46,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:31:46,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:31:46,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:31:46,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:31:46,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:31:46,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:31:46,063 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:31:46,082 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:31:46,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:31:46,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:31:46,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:31:46,084 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:31:46,085 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:31:46,085 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:31:46,085 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:31:46,085 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:31:46,085 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:31:46,086 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:31:46,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:31:46,086 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:31:46,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:31:46,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:31:46,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:31:46,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:31:46,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:31:46,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:31:46,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:31:46,088 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:31:46,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:31:46,088 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:31:46,088 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:31:46,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:31:46,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:31:46,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:31:46,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:31:46,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:31:46,089 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:31:46,090 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:31:46,090 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 -> a1351cae46a0bf53747c47a3bd817fbc84c54eae [2021-07-06 20:31:46,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:31:46,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:31:46,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:31:46,359 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:31:46,373 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:31:46,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product61.cil.c [2021-07-06 20:31:46,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f857af8/b7b9980dda144746b6cd2ba3894c0736/FLAG5bb6913d9 [2021-07-06 20:31:46,919 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:31:46,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product61.cil.c [2021-07-06 20:31:46,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f857af8/b7b9980dda144746b6cd2ba3894c0736/FLAG5bb6913d9 [2021-07-06 20:31:46,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f857af8/b7b9980dda144746b6cd2ba3894c0736 [2021-07-06 20:31:46,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:31:46,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:31:46,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:31:46,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:31:46,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:31:46,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:31:46" (1/1) ... [2021-07-06 20:31:46,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7c7c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:46, skipping insertion in model container [2021-07-06 20:31:46,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:31:46" (1/1) ... [2021-07-06 20:31:46,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:31:47,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:31:47,110 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_spec4_product61.cil.c[1281,1294] [2021-07-06 20:31:47,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:31:47,277 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:31:47,291 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_spec4_product61.cil.c[1281,1294] [2021-07-06 20:31:47,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:31:47,386 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:31:47,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47 WrapperNode [2021-07-06 20:31:47,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:31:47,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:31:47,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:31:47,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:31:47,393 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:31:47" (1/1) ... [2021-07-06 20:31:47,417 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:31:47" (1/1) ... [2021-07-06 20:31:47,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:31:47,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:31:47,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:31:47,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:31:47,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:31:47,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:31:47,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:31:47,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:31:47,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (1/1) ... [2021-07-06 20:31:47,510 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:31:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:31:47,523 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:31:47,527 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:31:47,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:31:47,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:31:47,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:31:47,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:31:48,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:31:48,225 INFO L299 CfgBuilder]: Removed 348 assume(true) statements. [2021-07-06 20:31:48,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:31:48 BoogieIcfgContainer [2021-07-06 20:31:48,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:31:48,227 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:31:48,227 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:31:48,229 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:31:48,230 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:31:48,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:31:46" (1/3) ... [2021-07-06 20:31:48,230 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71b44f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:31:48, skipping insertion in model container [2021-07-06 20:31:48,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:31:48,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:31:47" (2/3) ... [2021-07-06 20:31:48,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71b44f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:31:48, skipping insertion in model container [2021-07-06 20:31:48,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:31:48,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:31:48" (3/3) ... [2021-07-06 20:31:48,232 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product61.cil.c [2021-07-06 20:31:48,258 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:31:48,258 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:31:48,259 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:31:48,259 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:31:48,259 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:31:48,259 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:31:48,259 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:31:48,259 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:31:48,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 222 states, 221 states have (on average 1.506787330316742) internal successors, (333), 221 states have internal predecessors, (333), 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:31:48,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 145 [2021-07-06 20:31:48,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:31:48,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:31:48,295 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:31:48,295 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:31:48,296 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:31:48,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 222 states, 221 states have (on average 1.506787330316742) internal successors, (333), 221 states have internal predecessors, (333), 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:31:48,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 145 [2021-07-06 20:31:48,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:31:48,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:31:48,302 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:31:48,302 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:31:48,306 INFO L791 eck$LassoCheckResult]: Stem: 47#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~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 10#L-1true havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~11;havoc main_~retValue_acc~13;havoc main_~tmp~11; 15#L76true havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 97#L84true main_#t~ret82 := valid_product_#res;main_~tmp~11 := main_#t~ret82;havoc main_#t~ret82; 139#L986true assume 0 != main_~tmp~11; 58#L963true havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 160#L520-1true [2021-07-06 20:31:48,306 INFO L793 eck$LassoCheckResult]: Loop: 160#L520-1true assume !false; 88#L354true assume test_~splverifierCounter~0 < 4; 148#L355true test_~tmp~6 := test_#t~nondet31;havoc test_#t~nondet31; 63#L363true assume !(0 != test_~tmp~6); 64#L363-1true test_~tmp___0~2 := test_#t~nondet32;havoc test_#t~nondet32; 32#L373true assume !(0 != test_~tmp___0~2); 11#L373-1true test_~tmp___2~0 := test_#t~nondet33;havoc test_#t~nondet33; 142#L383true assume 0 != test_~tmp___2~0; 35#L389-2true assume !(0 != ~pumpRunning~0); 185#L107true assume !(0 != ~systemActive~0); 28#L114true havoc __utac_acc__Specification4_spec__1_#t~ret45, __utac_acc__Specification4_spec__1_#t~ret46, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 57#L484true __utac_acc__Specification4_spec__1_#t~ret45 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret45;havoc __utac_acc__Specification4_spec__1_#t~ret45; 158#L520true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 160#L520-1true [2021-07-06 20:31:48,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-07-06 20:31:48,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:48,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127605238] [2021-07-06 20:31:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:48,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:48,513 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:48,590 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:48,624 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:31:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1675126782, now seen corresponding path program 1 times [2021-07-06 20:31:48,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:48,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170597786] [2021-07-06 20:31:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:48,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:48,644 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:48,650 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:48,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:31:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash 39152156, now seen corresponding path program 1 times [2021-07-06 20:31:48,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:48,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163893175] [2021-07-06 20:31:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:48,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:31:48,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:48,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:31:48,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:48,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:31:48,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:48,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:31:48,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:48,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-06 20:31:48,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:48,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:31:48,787 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:31:48,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:31:48,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163893175] [2021-07-06 20:31:48,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163893175] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:31:48,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:31:48,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-06 20:31:48,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065474850] [2021-07-06 20:31:48,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:48,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-06 20:31:48,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:31:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-06 20:31:48,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-06 20:31:48,849 INFO L87 Difference]: Start difference. First operand has 222 states, 221 states have (on average 1.506787330316742) internal successors, (333), 221 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:31:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:31:48,980 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2021-07-06 20:31:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-06 20:31:48,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 322 transitions. [2021-07-06 20:31:48,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 143 [2021-07-06 20:31:48,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 215 states and 315 transitions. [2021-07-06 20:31:48,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2021-07-06 20:31:48,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2021-07-06 20:31:48,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 315 transitions. [2021-07-06 20:31:48,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:31:48,991 INFO L681 BuchiCegarLoop]: Abstraction has 215 states and 315 transitions. [2021-07-06 20:31:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 315 transitions. [2021-07-06 20:31:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-07-06 20:31:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 215 states have (on average 1.4651162790697674) internal successors, (315), 214 states have internal predecessors, (315), 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:31:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 315 transitions. [2021-07-06 20:31:49,015 INFO L704 BuchiCegarLoop]: Abstraction has 215 states and 315 transitions. [2021-07-06 20:31:49,015 INFO L587 BuchiCegarLoop]: Abstraction has 215 states and 315 transitions. [2021-07-06 20:31:49,015 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:31:49,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 315 transitions. [2021-07-06 20:31:49,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 143 [2021-07-06 20:31:49,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:31:49,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:31:49,018 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:31:49,018 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:31:49,018 INFO L791 eck$LassoCheckResult]: Stem: 546#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~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 475#L-1 havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~11;havoc main_~retValue_acc~13;havoc main_~tmp~11; 476#L76 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 485#L84 main_#t~ret82 := valid_product_#res;main_~tmp~11 := main_#t~ret82;havoc main_#t~ret82; 620#L986 assume 0 != main_~tmp~11; 568#L963 havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 569#L520-1 [2021-07-06 20:31:49,019 INFO L793 eck$LassoCheckResult]: Loop: 569#L520-1 assume !false; 606#L354 assume test_~splverifierCounter~0 < 4; 607#L355 test_~tmp~6 := test_#t~nondet31;havoc test_#t~nondet31; 576#L363 assume !(0 != test_~tmp~6); 578#L363-1 test_~tmp___0~2 := test_#t~nondet32;havoc test_#t~nondet32; 512#L373 assume !(0 != test_~tmp___0~2); 477#L373-1 test_~tmp___2~0 := test_#t~nondet33;havoc test_#t~nondet33; 478#L383 assume 0 != test_~tmp___2~0; 520#L389-2 assume !(0 != ~pumpRunning~0); 521#L107 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret10, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 523#L191 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret9, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 524#L165-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret8, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 565#L139-3 assume !(0 == ~pumpRunning~0); 505#L114 havoc __utac_acc__Specification4_spec__1_#t~ret45, __utac_acc__Specification4_spec__1_#t~ret46, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 506#L484 __utac_acc__Specification4_spec__1_#t~ret45 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret45;havoc __utac_acc__Specification4_spec__1_#t~ret45; 567#L520 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 569#L520-1 [2021-07-06 20:31:49,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:49,019 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-07-06 20:31:49,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:49,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127831642] [2021-07-06 20:31:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:49,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,041 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,061 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,069 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:31:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash 391395521, now seen corresponding path program 1 times [2021-07-06 20:31:49,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:49,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684084560] [2021-07-06 20:31:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:49,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:31:49,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:49,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:31:49,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:49,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:31:49,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:49,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:31:49,079 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:31:49,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:31:49,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684084560] [2021-07-06 20:31:49,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684084560] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:31:49,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:31:49,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:31:49,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423704693] [2021-07-06 20:31:49,080 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:31:49,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:31:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:31:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:31:49,081 INFO L87 Difference]: Start difference. First operand 215 states and 315 transitions. cyclomatic complexity: 102 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:31:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:31:49,150 INFO L93 Difference]: Finished difference Result 211 states and 291 transitions. [2021-07-06 20:31:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:31:49,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 291 transitions. [2021-07-06 20:31:49,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 144 [2021-07-06 20:31:49,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 211 states and 291 transitions. [2021-07-06 20:31:49,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 211 [2021-07-06 20:31:49,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2021-07-06 20:31:49,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 291 transitions. [2021-07-06 20:31:49,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:31:49,161 INFO L681 BuchiCegarLoop]: Abstraction has 211 states and 291 transitions. [2021-07-06 20:31:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 291 transitions. [2021-07-06 20:31:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-07-06 20:31:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 210 states have internal predecessors, (291), 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:31:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 291 transitions. [2021-07-06 20:31:49,167 INFO L704 BuchiCegarLoop]: Abstraction has 211 states and 291 transitions. [2021-07-06 20:31:49,167 INFO L587 BuchiCegarLoop]: Abstraction has 211 states and 291 transitions. [2021-07-06 20:31:49,167 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:31:49,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 291 transitions. [2021-07-06 20:31:49,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 144 [2021-07-06 20:31:49,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:31:49,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:31:49,189 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-07-06 20:31:49,189 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] [2021-07-06 20:31:49,189 INFO L791 eck$LassoCheckResult]: Stem: 1030#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~string14.base, #t~string14.offset := #Ultimate.allocOnStack(13);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(110, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 2 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string18.base, #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(102, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 3 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string20.base, #t~string20.offset, 1);call write~init~int(80, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(117, #t~string20.base, 2 + #t~string20.offset, 1);call write~init~int(109, #t~string20.base, 3 + #t~string20.offset, 1);call write~init~int(112, #t~string20.base, 4 + #t~string20.offset, 1);call write~init~int(58, #t~string20.base, 5 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 6 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(110, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 2 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string24.base, #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(102, #t~string24.base, 2 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 3 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string26.base, #t~string26.offset, 1);call write~init~int(32, #t~string26.base, 1 + #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 2 + #t~string26.offset, 1);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string28.base, #t~string28.offset, 1);call write~init~int(0, #t~string28.base, 1 + #t~string28.offset, 1);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(13);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string38.base, #t~string38.offset, 1);call write~init~int(77, #t~string38.base, 1 + #t~string38.offset, 1);call write~init~int(101, #t~string38.base, 2 + #t~string38.offset, 1);call write~init~int(116, #t~string38.base, 3 + #t~string38.offset, 1);call write~init~int(104, #t~string38.base, 4 + #t~string38.offset, 1);call write~init~int(58, #t~string38.base, 5 + #t~string38.offset, 1);call write~init~int(0, #t~string38.base, 6 + #t~string38.offset, 1);call #t~string40.base, #t~string40.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string40.base, #t~string40.offset, 1);call write~init~int(82, #t~string40.base, 1 + #t~string40.offset, 1);call write~init~int(73, #t~string40.base, 2 + #t~string40.offset, 1);call write~init~int(84, #t~string40.base, 3 + #t~string40.offset, 1);call write~init~int(0, #t~string40.base, 4 + #t~string40.offset, 1);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string42.base, #t~string42.offset, 1);call write~init~int(75, #t~string42.base, 1 + #t~string42.offset, 1);call write~init~int(0, #t~string42.base, 2 + #t~string42.offset, 1);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string44.base, #t~string44.offset, 1);call write~init~int(0, #t~string44.base, 1 + #t~string44.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(30);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(9);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(21);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(30);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(9);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(21);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(30);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(9);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(25);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(30);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(9);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(25);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; 930#L-1 havoc main_#res;havoc main_#t~ret82, main_~retValue_acc~13, main_~tmp~11;havoc main_~retValue_acc~13;havoc main_~tmp~11; 931#L76 havoc valid_product_#res;havoc valid_product_~retValue_acc~1;havoc valid_product_~retValue_acc~1;valid_product_~retValue_acc~1 := 1;valid_product_#res := valid_product_~retValue_acc~1; 928#L84 main_#t~ret82 := valid_product_#res;main_~tmp~11 := main_#t~ret82;havoc main_#t~ret82; 929#L986 assume 0 != main_~tmp~11; 1007#L963 havoc test_#t~nondet31, test_#t~nondet32, test_#t~nondet33, test_#t~nondet34, test_~splverifierCounter~0, test_~tmp~6, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~6;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 984#L520-1 [2021-07-06 20:31:49,190 INFO L793 eck$LassoCheckResult]: Loop: 984#L520-1 assume !false; 909#L354 assume test_~splverifierCounter~0 < 4; 910#L355 test_~tmp~6 := test_#t~nondet31;havoc test_#t~nondet31; 1022#L363 assume !(0 != test_~tmp~6); 1011#L363-1 test_~tmp___0~2 := test_#t~nondet32;havoc test_#t~nondet32; 965#L373 assume !(0 != test_~tmp___0~2); 932#L373-1 test_~tmp___2~0 := test_#t~nondet33;havoc test_#t~nondet33; 933#L383 assume 0 != test_~tmp___2~0; 979#L389-2 assume !(0 != ~pumpRunning~0); 980#L107 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret10, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 989#L191 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__methaneQuery_#t~ret9, processEnvironment__wrappee__methaneQuery_~tmp~1;havoc processEnvironment__wrappee__methaneQuery_~tmp~1; 990#L165-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret8, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 924#L139-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret29, isHighWaterLevel_~retValue_acc~4, isHighWaterLevel_~tmp~4, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~4;havoc isHighWaterLevel_~tmp~4;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~8;havoc isHighWaterSensorDry_~retValue_acc~8; 925#L492-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~8 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~8; 896#L497-3 isHighWaterLevel_#t~ret29 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~4 := isHighWaterLevel_#t~ret29;havoc isHighWaterLevel_#t~ret29; 897#L310-9 assume 0 != isHighWaterLevel_~tmp~4;isHighWaterLevel_~tmp___0~0 := 0; 1062#L310-11 isHighWaterLevel_~retValue_acc~4 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~4; 1043#L316-3 processEnvironment__wrappee__highWaterSensor_#t~ret8 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret8;havoc processEnvironment__wrappee__highWaterSensor_#t~ret8; 1035#L143-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 920#L114 havoc __utac_acc__Specification4_spec__1_#t~ret45, __utac_acc__Specification4_spec__1_#t~ret46, __utac_acc__Specification4_spec__1_~tmp~7, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~7;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~7;havoc getWaterLevel_~retValue_acc~7;getWaterLevel_~retValue_acc~7 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~7; 962#L484 __utac_acc__Specification4_spec__1_#t~ret45 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~7 := __utac_acc__Specification4_spec__1_#t~ret45;havoc __utac_acc__Specification4_spec__1_#t~ret45; 1031#L520 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~7); 984#L520-1 [2021-07-06 20:31:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-07-06 20:31:49,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:49,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207224023] [2021-07-06 20:31:49,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:49,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,215 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,232 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:31:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash 697809965, now seen corresponding path program 1 times [2021-07-06 20:31:49,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:49,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143581599] [2021-07-06 20:31:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:49,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,243 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,246 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,248 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:31:49,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:31:49,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1951115091, now seen corresponding path program 1 times [2021-07-06 20:31:49,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:31:49,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029677513] [2021-07-06 20:31:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:31:49,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:31:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,265 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:31:49,281 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:31:49,289 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:31:49,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:31:49,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-07-06 20:32:31,510 WARN L205 SmtUtils]: Spent 42.08 s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-07-06 20:32:31,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:31,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2127 [2021-07-06 20:32:52,935 WARN L205 SmtUtils]: Spent 21.32 s on a formula simplification that was a NOOP. DAG size: 433 [2021-07-06 20:32:53,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:32:53 BoogieIcfgContainer [2021-07-06 20:32:53,074 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:32:53,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:32:53,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:32:53,075 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:32:53,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:31:48" (3/4) ... [2021-07-06 20:32:53,077 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:32:53,128 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:32:53,129 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:32:53,129 INFO L168 Benchmark]: Toolchain (without parser) took 66178.80 ms. Allocated memory was 83.9 MB in the beginning and 148.9 MB in the end (delta: 65.0 MB). Free memory was 59.2 MB in the beginning and 75.9 MB in the end (delta: -16.7 MB). Peak memory consumption was 49.0 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,145 INFO L168 Benchmark]: CDTParser took 1.10 ms. Allocated memory is still 52.4 MB. Free memory was 33.1 MB in the beginning and 33.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:32:53,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.32 ms. Allocated memory is still 83.9 MB. Free memory was 59.0 MB in the beginning and 56.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.23 ms. Allocated memory is still 83.9 MB. Free memory was 56.5 MB in the beginning and 51.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,145 INFO L168 Benchmark]: Boogie Preprocessor took 35.01 ms. Allocated memory is still 83.9 MB. Free memory was 51.0 MB in the beginning and 47.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,145 INFO L168 Benchmark]: RCFGBuilder took 721.47 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.1 MB in the beginning and 64.0 MB in the end (delta: -16.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,146 INFO L168 Benchmark]: BuchiAutomizer took 64846.66 ms. Allocated memory was 109.1 MB in the beginning and 148.9 MB in the end (delta: 39.8 MB). Free memory was 64.0 MB in the beginning and 78.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 69.8 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,146 INFO L168 Benchmark]: Witness Printer took 54.72 ms. Allocated memory is still 148.9 MB. Free memory was 78.0 MB in the beginning and 75.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-06 20:32:53,147 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10 ms. Allocated memory is still 52.4 MB. Free memory was 33.1 MB in the beginning and 33.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 436.32 ms. Allocated memory is still 83.9 MB. Free memory was 59.0 MB in the beginning and 56.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.23 ms. Allocated memory is still 83.9 MB. Free memory was 56.5 MB in the beginning and 51.0 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.01 ms. Allocated memory is still 83.9 MB. Free memory was 51.0 MB in the beginning and 47.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 721.47 ms. Allocated memory was 83.9 MB in the beginning and 109.1 MB in the end (delta: 25.2 MB). Free memory was 47.1 MB in the beginning and 64.0 MB in the end (delta: -16.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 64846.66 ms. Allocated memory was 109.1 MB in the beginning and 148.9 MB in the end (delta: 39.8 MB). Free memory was 64.0 MB in the beginning and 78.0 MB in the end (delta: -14.0 MB). Peak memory consumption was 69.8 MB. Max. memory is 16.1 GB. * Witness Printer took 54.72 ms. Allocated memory is still 148.9 MB. Free memory was 78.0 MB in the beginning and 75.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 211 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 64.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 64.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 20.6ms AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 215 states and ocurred in iteration 1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 539 SDtfs, 1127 SDslu, 77 SDs, 0 SdLazy, 50 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.3ms Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 353]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=12381} State at position 1 is {NULL=0, NULL=12381, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ff753bc=0, NULL=0, NULL=12406, methaneLevelCritical=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50de1375=0, retValue_acc=0, NULL=0, tmp=0, NULL=12388, NULL=0, tmp___1=0, NULL=0, NULL=12389, NULL=12400, cleanupTimeShifts=4, NULL=12386, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d1bd12a=0, NULL=12401, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@36c09081=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@540024cc=53, waterLevel=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ba621f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f52efc=0, NULL=12383, \result=1, head=0, pumpRunning=0, retValue_acc=1, NULL=12396, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6a893292=0, \result=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16be2442=0, NULL=0, NULL=0, tmp=1, NULL=0, NULL=12407, NULL=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f6d02c0=0, tmp=1, retValue_acc=1, NULL=0, tmp___0=0, NULL=12409, NULL=12397, tmp=0, head=0, tmp=0, NULL=0, NULL=0, NULL=12399, NULL=0, NULL=0, NULL=12395, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@494c99d8=0, tmp___0=0, NULL=0, NULL=0, NULL=12404, NULL=0, NULL=0, tmp=0, NULL=12398, tmp___0=0, NULL=0, systemActive=1, NULL=12394, \result=1, NULL=0, \result=0, NULL=12408, retValue_acc=0, NULL=12405, \result=0, NULL=12384, NULL=0, NULL=0, NULL=12391, NULL=12402, NULL=12403, NULL=12393, retValue_acc=1, tmp___2=53, splverifierCounter=0, NULL=0, NULL=12382, NULL=12385, NULL=0, NULL=0, NULL=12390, NULL=0, NULL=12392, NULL=12387} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L99] int pumpRunning = 0; [L100] int systemActive = 1; [L409] int waterLevel = 1; [L410] int methaneLevelCritical = 0; [L707] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L904] int cleanupTimeShifts = 4; [L977] int retValue_acc ; [L978] int tmp ; [L80] int retValue_acc ; [L83] retValue_acc = 1 [L84] return (retValue_acc); [L984] tmp = valid_product() [L986] COND TRUE \read(tmp) [L344] int splverifierCounter ; [L345] int tmp ; [L346] int tmp___0 ; [L347] int tmp___1 ; [L348] int tmp___2 ; [L351] splverifierCounter = 0 Loop: [L353] COND TRUE 1 [L355] COND TRUE splverifierCounter < 4 [L361] tmp = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp)) [L371] tmp___0 = __VERIFIER_nondet_int() [L373] COND FALSE !(\read(tmp___0)) [L381] tmp___2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp___2) [L107] COND FALSE !(\read(pumpRunning)) [L114] COND TRUE \read(systemActive) [L188] int tmp ; [L191] COND FALSE !(\read(pumpRunning)) [L162] int tmp ; [L165] COND FALSE !(\read(pumpRunning)) [L136] int tmp ; [L139] COND TRUE ! pumpRunning [L302] int retValue_acc ; [L303] int tmp ; [L304] int tmp___0 ; [L489] int retValue_acc ; [L492] COND TRUE waterLevel < 2 [L493] retValue_acc = 1 [L494] return (retValue_acc); [L308] tmp = isHighWaterSensorDry() [L310] COND TRUE \read(tmp) [L311] tmp___0 = 0 [L315] retValue_acc = tmp___0 [L316] return (retValue_acc); [L141] tmp = isHighWaterLevel() [L143] COND FALSE !(\read(tmp)) [L513] int tmp ; [L514] int tmp___0 ; [L480] int retValue_acc ; [L483] retValue_acc = waterLevel [L484] return (retValue_acc); [L518] tmp = getWaterLevel() [L520] COND FALSE !(tmp == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:32:53,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...