./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product06.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 15f9bfbb11bcf46fb604afe26b15207926ff78e9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:32:28,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-06 20:32:28,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-06 20:32:28,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-06 20:32:28,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-06 20:32:28,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-06 20:32:28,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-06 20:32:28,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-06 20:32:28,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-06 20:32:28,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-06 20:32:28,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-06 20:32:28,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-06 20:32:28,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-06 20:32:28,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-06 20:32:28,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-06 20:32:28,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-06 20:32:28,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-06 20:32:28,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-06 20:32:28,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-06 20:32:28,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-06 20:32:28,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-06 20:32:28,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-06 20:32:28,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-06 20:32:28,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-06 20:32:28,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-06 20:32:28,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-06 20:32:28,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-06 20:32:28,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-06 20:32:28,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-06 20:32:28,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-06 20:32:28,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-06 20:32:28,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-06 20:32:28,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-06 20:32:28,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-06 20:32:28,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-06 20:32:28,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-06 20:32:28,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-06 20:32:28,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-06 20:32:28,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-06 20:32:28,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-06 20:32:28,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-06 20:32:28,516 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:32:28,561 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-06 20:32:28,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-06 20:32:28,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-06 20:32:28,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-06 20:32:28,564 INFO L138 SettingsManager]: * Use SBE=true [2021-07-06 20:32:28,564 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-07-06 20:32:28,564 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-07-06 20:32:28,564 INFO L138 SettingsManager]: * Use old map elimination=false [2021-07-06 20:32:28,564 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-07-06 20:32:28,564 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-07-06 20:32:28,565 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-07-06 20:32:28,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-06 20:32:28,565 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-07-06 20:32:28,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-07-06 20:32:28,567 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-06 20:32:28,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-06 20:32:28,567 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-07-06 20:32:28,567 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-06 20:32:28,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-07-06 20:32:28,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-06 20:32:28,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-06 20:32:28,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-06 20:32:28,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-06 20:32:28,581 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-06 20:32:28,582 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-07-06 20:32:28,582 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 -> 15f9bfbb11bcf46fb604afe26b15207926ff78e9 [2021-07-06 20:32:28,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-06 20:32:29,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-06 20:32:29,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-06 20:32:29,030 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-06 20:32:29,032 INFO L275 PluginConnector]: CDTParser initialized [2021-07-06 20:32:29,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c [2021-07-06 20:32:29,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b5249ac/72a1da0a4b484effa53d64477e4efa37/FLAGa5ab5cda2 [2021-07-06 20:32:29,474 INFO L306 CDTParser]: Found 1 translation units. [2021-07-06 20:32:29,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c [2021-07-06 20:32:29,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b5249ac/72a1da0a4b484effa53d64477e4efa37/FLAGa5ab5cda2 [2021-07-06 20:32:29,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b5249ac/72a1da0a4b484effa53d64477e4efa37 [2021-07-06 20:32:29,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-06 20:32:29,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-06 20:32:29,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-06 20:32:29,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-06 20:32:29,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-06 20:32:29,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b522a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29, skipping insertion in model container [2021-07-06 20:32:29,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-06 20:32:29,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-06 20:32:29,794 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c[17387,17400] [2021-07-06 20:32:29,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:32:29,801 INFO L203 MainTranslator]: Completed pre-run [2021-07-06 20:32:29,835 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product06.cil.c[17387,17400] [2021-07-06 20:32:29,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-06 20:32:29,853 INFO L208 MainTranslator]: Completed translation [2021-07-06 20:32:29,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29 WrapperNode [2021-07-06 20:32:29,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-06 20:32:29,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-06 20:32:29,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-06 20:32:29,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-06 20:32:29,859 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:32:29" (1/1) ... [2021-07-06 20:32:29,868 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:32:29" (1/1) ... [2021-07-06 20:32:29,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-06 20:32:29,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-06 20:32:29,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-06 20:32:29,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-06 20:32:29,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-06 20:32:29,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-06 20:32:29,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-06 20:32:29,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-06 20:32:29,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (1/1) ... [2021-07-06 20:32:29,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-07-06 20:32:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-06 20:32:29,928 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:32:29,965 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:32:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-06 20:32:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-06 20:32:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-06 20:32:29,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-06 20:32:30,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-06 20:32:30,468 INFO L299 CfgBuilder]: Removed 112 assume(true) statements. [2021-07-06 20:32:30,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:32:30 BoogieIcfgContainer [2021-07-06 20:32:30,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-06 20:32:30,470 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-07-06 20:32:30,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-07-06 20:32:30,472 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-07-06 20:32:30,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:32:30,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.07 08:32:29" (1/3) ... [2021-07-06 20:32:30,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bb7c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:32:30, skipping insertion in model container [2021-07-06 20:32:30,473 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:32:30,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.07 08:32:29" (2/3) ... [2021-07-06 20:32:30,474 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bb7c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.07 08:32:30, skipping insertion in model container [2021-07-06 20:32:30,474 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-07-06 20:32:30,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:32:30" (3/3) ... [2021-07-06 20:32:30,475 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec5_product06.cil.c [2021-07-06 20:32:30,499 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-07-06 20:32:30,499 INFO L360 BuchiCegarLoop]: Hoare is false [2021-07-06 20:32:30,499 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-07-06 20:32:30,499 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-06 20:32:30,499 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-06 20:32:30,499 INFO L364 BuchiCegarLoop]: Difference is false [2021-07-06 20:32:30,500 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-06 20:32:30,500 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-07-06 20:32:30,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 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:32:30,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2021-07-06 20:32:30,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:32:30,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:32:30,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:32:30,525 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:32:30,525 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-07-06 20:32:30,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 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:32:30,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2021-07-06 20:32:30,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:32:30,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:32:30,533 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:32:30,533 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:32:30,540 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(75, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);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~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25);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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 9#L-1true havoc main_#res;havoc main_#t~ret40, main_~retValue_acc~6, main_~tmp~2;havoc main_~retValue_acc~6;havoc main_~tmp~2; 24#L153true havoc valid_product_#res;havoc valid_product_~retValue_acc~3;havoc valid_product_~retValue_acc~3;valid_product_~retValue_acc~3 := 1;valid_product_#res := valid_product_~retValue_acc~3; 40#L161true main_#t~ret40 := valid_product_#res;main_~tmp~2 := main_#t~ret40;havoc main_#t~ret40; 64#L470true assume 0 != main_~tmp~2; 72#L445true ~switchedOnBeforeTS~0 := 0; 52#L491true havoc test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_#t~nondet21, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 36#L512-1true [2021-07-06 20:32:30,540 INFO L793 eck$LassoCheckResult]: Loop: 36#L512-1true assume !false; 37#L180true assume test_~splverifierCounter~0 < 4; 70#L181true test_~tmp~0 := test_#t~nondet18;havoc test_#t~nondet18; 65#L189true assume !(0 != test_~tmp~0); 62#L189-1true test_~tmp___0~0 := test_#t~nondet19;havoc test_#t~nondet19; 50#L199true assume !(0 != test_~tmp___0~0); 49#L199-1true test_~tmp___2~0 := test_#t~nondet20;havoc test_#t~nondet20; 29#L209true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 53#L217-2true havoc __utac_acc__Specification5_spec__2_#t~ret41;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 43#L337true __utac_acc__Specification5_spec__2_#t~ret41 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret41;havoc __utac_acc__Specification5_spec__2_#t~ret41; 34#L501true assume !(0 != ~pumpRunning~0); 8#L252true assume !(0 != ~systemActive~0); 23#L259true havoc __utac_acc__Specification5_spec__3_#t~ret42, __utac_acc__Specification5_spec__3_#t~ret43, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 61#L123true __utac_acc__Specification5_spec__3_#t~ret42 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret42;havoc __utac_acc__Specification5_spec__3_#t~ret42; 32#L512true assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 36#L512-1true [2021-07-06 20:32:30,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 1 times [2021-07-06 20:32:30,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:30,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001337440] [2021-07-06 20:32:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:30,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:30,743 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:30,816 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:30,846 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:32:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1011068557, now seen corresponding path program 1 times [2021-07-06 20:32:30,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:30,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935135682] [2021-07-06 20:32:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:30,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:32:30,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:30,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:32:30,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:30,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:32:30,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:30,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-06 20:32:30,908 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:32:30,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:32:30,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935135682] [2021-07-06 20:32:30,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935135682] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:32:30,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:32:30,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:32:30,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737911558] [2021-07-06 20:32:30,912 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-07-06 20:32:30,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:32:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-06 20:32:30,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-06 20:32:30,922 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:32:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:32:30,954 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2021-07-06 20:32:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-06 20:32:30,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 101 transitions. [2021-07-06 20:32:30,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-07-06 20:32:30,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 68 states and 93 transitions. [2021-07-06 20:32:30,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-07-06 20:32:30,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-07-06 20:32:30,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 93 transitions. [2021-07-06 20:32:30,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:32:30,961 INFO L681 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2021-07-06 20:32:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 93 transitions. [2021-07-06 20:32:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-06 20:32:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 states have internal predecessors, (93), 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:32:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2021-07-06 20:32:30,979 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2021-07-06 20:32:30,979 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 93 transitions. [2021-07-06 20:32:30,979 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-07-06 20:32:30,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 93 transitions. [2021-07-06 20:32:30,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2021-07-06 20:32:30,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:32:30,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:32:30,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:32:30,980 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:32:30,981 INFO L791 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(75, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);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~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25);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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 171#L-1 havoc main_#res;havoc main_#t~ret40, main_~retValue_acc~6, main_~tmp~2;havoc main_~retValue_acc~6;havoc main_~tmp~2; 172#L153 havoc valid_product_#res;havoc valid_product_~retValue_acc~3;havoc valid_product_~retValue_acc~3;valid_product_~retValue_acc~3 := 1;valid_product_#res := valid_product_~retValue_acc~3; 195#L161 main_#t~ret40 := valid_product_#res;main_~tmp~2 := main_#t~ret40;havoc main_#t~ret40; 214#L470 assume 0 != main_~tmp~2; 223#L445 ~switchedOnBeforeTS~0 := 0; 222#L491 havoc test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_#t~nondet21, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 197#L512-1 [2021-07-06 20:32:30,981 INFO L793 eck$LassoCheckResult]: Loop: 197#L512-1 assume !false; 210#L180 assume test_~splverifierCounter~0 < 4; 211#L181 test_~tmp~0 := test_#t~nondet18;havoc test_#t~nondet18; 224#L189 assume !(0 != test_~tmp~0); 216#L189-1 test_~tmp___0~0 := test_#t~nondet19;havoc test_#t~nondet19; 220#L199 assume !(0 != test_~tmp___0~0); 219#L199-1 test_~tmp___2~0 := test_#t~nondet20;havoc test_#t~nondet20; 201#L209 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 203#L217-2 havoc __utac_acc__Specification5_spec__2_#t~ret41;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 217#L337 __utac_acc__Specification5_spec__2_#t~ret41 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret41;havoc __utac_acc__Specification5_spec__2_#t~ret41; 209#L501 assume !(0 != ~pumpRunning~0); 169#L252 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 170#L284 assume !(0 != ~pumpRunning~0); 181#L259 havoc __utac_acc__Specification5_spec__3_#t~ret42, __utac_acc__Specification5_spec__3_#t~ret43, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 192#L123 __utac_acc__Specification5_spec__3_#t~ret42 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret42;havoc __utac_acc__Specification5_spec__3_#t~ret42; 206#L512 assume !(2 != __utac_acc__Specification5_spec__3_~tmp~3); 197#L512-1 [2021-07-06 20:32:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:30,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 2 times [2021-07-06 20:32:30,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:30,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865238098] [2021-07-06 20:32:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:30,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,005 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,040 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,059 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:32:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:31,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1257825731, now seen corresponding path program 1 times [2021-07-06 20:32:31,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:31,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687548713] [2021-07-06 20:32:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:31,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,063 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,065 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:32:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1083065097, now seen corresponding path program 1 times [2021-07-06 20:32:31,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:31,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807196956] [2021-07-06 20:32:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:31,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-06 20:32:31,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:31,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:32:31,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:31,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:32:31,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:31,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-06 20:32:31,155 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:32:31,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-06 20:32:31,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807196956] [2021-07-06 20:32:31,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807196956] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-06 20:32:31,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-06 20:32:31,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-06 20:32:31,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331906896] [2021-07-06 20:32:31,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:31,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-06 20:32:31,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-06 20:32:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-06 20:32:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-06 20:32:31,270 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. cyclomatic complexity: 27 Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-06 20:32:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-06 20:32:31,380 INFO L93 Difference]: Finished difference Result 188 states and 255 transitions. [2021-07-06 20:32:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-06 20:32:31,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 255 transitions. [2021-07-06 20:32:31,385 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2021-07-06 20:32:31,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 188 states and 255 transitions. [2021-07-06 20:32:31,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2021-07-06 20:32:31,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2021-07-06 20:32:31,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 255 transitions. [2021-07-06 20:32:31,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-07-06 20:32:31,394 INFO L681 BuchiCegarLoop]: Abstraction has 188 states and 255 transitions. [2021-07-06 20:32:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 255 transitions. [2021-07-06 20:32:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 129. [2021-07-06 20:32:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 128 states have internal predecessors, (172), 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:32:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2021-07-06 20:32:31,409 INFO L704 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2021-07-06 20:32:31,409 INFO L587 BuchiCegarLoop]: Abstraction has 129 states and 172 transitions. [2021-07-06 20:32:31,409 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-07-06 20:32:31,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 172 transitions. [2021-07-06 20:32:31,410 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 87 [2021-07-06 20:32:31,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-07-06 20:32:31,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-07-06 20:32:31,412 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:32:31,412 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-06 20:32:31,412 INFO L791 eck$LassoCheckResult]: Stem: 488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(31);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);call #t~string8.base, #t~string8.offset := #Ultimate.allocOnStack(13);call #t~string10.base, #t~string10.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string10.base, #t~string10.offset, 1);call write~init~int(77, #t~string10.base, 1 + #t~string10.offset, 1);call write~init~int(101, #t~string10.base, 2 + #t~string10.offset, 1);call write~init~int(116, #t~string10.base, 3 + #t~string10.offset, 1);call write~init~int(104, #t~string10.base, 4 + #t~string10.offset, 1);call write~init~int(58, #t~string10.base, 5 + #t~string10.offset, 1);call write~init~int(0, #t~string10.base, 6 + #t~string10.offset, 1);call #t~string12.base, #t~string12.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string12.base, #t~string12.offset, 1);call write~init~int(82, #t~string12.base, 1 + #t~string12.offset, 1);call write~init~int(73, #t~string12.base, 2 + #t~string12.offset, 1);call write~init~int(84, #t~string12.base, 3 + #t~string12.offset, 1);call write~init~int(0, #t~string12.base, 4 + #t~string12.offset, 1);call #t~string14.base, #t~string14.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string14.base, #t~string14.offset, 1);call write~init~int(75, #t~string14.base, 1 + #t~string14.offset, 1);call write~init~int(0, #t~string14.base, 2 + #t~string14.offset, 1);call #t~string16.base, #t~string16.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string16.base, #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 1 + #t~string16.offset, 1);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(13);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string27.base, #t~string27.offset, 1);call write~init~int(110, #t~string27.base, 1 + #t~string27.offset, 1);call write~init~int(0, #t~string27.base, 2 + #t~string27.offset, 1);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string29.base, #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(102, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string31.base, #t~string31.offset, 1);call write~init~int(80, #t~string31.base, 1 + #t~string31.offset, 1);call write~init~int(117, #t~string31.base, 2 + #t~string31.offset, 1);call write~init~int(109, #t~string31.base, 3 + #t~string31.offset, 1);call write~init~int(112, #t~string31.base, 4 + #t~string31.offset, 1);call write~init~int(58, #t~string31.base, 5 + #t~string31.offset, 1);call write~init~int(0, #t~string31.base, 6 + #t~string31.offset, 1);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string33.base, #t~string33.offset, 1);call write~init~int(110, #t~string33.base, 1 + #t~string33.offset, 1);call write~init~int(0, #t~string33.base, 2 + #t~string33.offset, 1);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string35.base, #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 1 + #t~string35.offset, 1);call write~init~int(102, #t~string35.base, 2 + #t~string35.offset, 1);call write~init~int(0, #t~string35.base, 3 + #t~string35.offset, 1);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string37.base, #t~string37.offset, 1);call write~init~int(32, #t~string37.base, 1 + #t~string37.offset, 1);call write~init~int(0, #t~string37.base, 2 + #t~string37.offset, 1);call #t~string39.base, #t~string39.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string39.base, #t~string39.offset, 1);call write~init~int(0, #t~string39.base, 1 + #t~string39.offset, 1);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(30);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(9);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(21);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~string71.base, #t~string71.offset := #Ultimate.allocOnStack(30);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(9);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(25);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);~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~switchedOnBeforeTS~0 := 0;~head~0.base, ~head~0.offset := 0, 0; 448#L-1 havoc main_#res;havoc main_#t~ret40, main_~retValue_acc~6, main_~tmp~2;havoc main_~retValue_acc~6;havoc main_~tmp~2; 449#L153 havoc valid_product_#res;havoc valid_product_~retValue_acc~3;havoc valid_product_~retValue_acc~3;valid_product_~retValue_acc~3 := 1;valid_product_#res := valid_product_~retValue_acc~3; 469#L161 main_#t~ret40 := valid_product_#res;main_~tmp~2 := main_#t~ret40;havoc main_#t~ret40; 489#L470 assume 0 != main_~tmp~2; 509#L445 ~switchedOnBeforeTS~0 := 0; 500#L491 havoc test_#t~nondet18, test_#t~nondet19, test_#t~nondet20, test_#t~nondet21, test_~splverifierCounter~0, test_~tmp~0, test_~tmp___0~0, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~0;havoc test_~tmp___0~0;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 471#L512-1 [2021-07-06 20:32:31,413 INFO L793 eck$LassoCheckResult]: Loop: 471#L512-1 assume !false; 546#L180 assume test_~splverifierCounter~0 < 4; 513#L181 test_~tmp~0 := test_#t~nondet18;havoc test_#t~nondet18; 508#L189 assume !(0 != test_~tmp~0); 506#L189-1 test_~tmp___0~0 := test_#t~nondet19;havoc test_#t~nondet19; 507#L199 assume !(0 != test_~tmp___0~0); 496#L199-1 test_~tmp___2~0 := test_#t~nondet20;havoc test_#t~nondet20; 475#L209 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 477#L217-2 havoc __utac_acc__Specification5_spec__2_#t~ret41;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 490#L337 __utac_acc__Specification5_spec__2_#t~ret41 := isPumpRunning_#res;~switchedOnBeforeTS~0 := __utac_acc__Specification5_spec__2_#t~ret41;havoc __utac_acc__Specification5_spec__2_#t~ret41; 483#L501 assume !(0 != ~pumpRunning~0); 441#L252 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret22, processEnvironment_~tmp~1;havoc processEnvironment_~tmp~1; 442#L284 assume !(0 != ~pumpRunning~0); 453#L259 havoc __utac_acc__Specification5_spec__3_#t~ret42, __utac_acc__Specification5_spec__3_#t~ret43, __utac_acc__Specification5_spec__3_~tmp~3, __utac_acc__Specification5_spec__3_~tmp___0~1;havoc __utac_acc__Specification5_spec__3_~tmp~3;havoc __utac_acc__Specification5_spec__3_~tmp___0~1;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~1;havoc getWaterLevel_~retValue_acc~1;getWaterLevel_~retValue_acc~1 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~1; 466#L123 __utac_acc__Specification5_spec__3_#t~ret42 := getWaterLevel_#res;__utac_acc__Specification5_spec__3_~tmp~3 := __utac_acc__Specification5_spec__3_#t~ret42;havoc __utac_acc__Specification5_spec__3_#t~ret42; 480#L512 assume 2 != __utac_acc__Specification5_spec__3_~tmp~3;havoc isPumpRunning_#res;havoc isPumpRunning_~retValue_acc~5;havoc isPumpRunning_~retValue_acc~5;isPumpRunning_~retValue_acc~5 := ~pumpRunning~0;isPumpRunning_#res := isPumpRunning_~retValue_acc~5; 481#L337-1 __utac_acc__Specification5_spec__3_#t~ret43 := isPumpRunning_#res;__utac_acc__Specification5_spec__3_~tmp___0~1 := __utac_acc__Specification5_spec__3_#t~ret43;havoc __utac_acc__Specification5_spec__3_#t~ret43; 470#L516 assume !(0 != __utac_acc__Specification5_spec__3_~tmp___0~1); 471#L512-1 [2021-07-06 20:32:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1804904775, now seen corresponding path program 3 times [2021-07-06 20:32:31,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:31,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557143801] [2021-07-06 20:32:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:31,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,443 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,490 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,500 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:32:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1884702974, now seen corresponding path program 1 times [2021-07-06 20:32:31,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:31,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193786154] [2021-07-06 20:32:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:31,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,519 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,522 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,523 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:32:31,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-06 20:32:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1443458244, now seen corresponding path program 1 times [2021-07-06 20:32:31,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-06 20:32:31,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404974429] [2021-07-06 20:32:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-06 20:32:31,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-06 20:32:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,564 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-06 20:32:31,584 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-06 20:32:31,594 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-06 20:32:31,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:32:31,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-07-06 20:33:10,840 WARN L205 SmtUtils]: Spent 39.13 s on a formula simplification. DAG size of input: 495 DAG size of output: 437 [2021-07-06 20:33:10,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-06 20:33:10,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2130 [2021-07-06 20:33:30,883 WARN L205 SmtUtils]: Spent 20.00 s on a formula simplification that was a NOOP. DAG size: 435 [2021-07-06 20:33:30,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.07 08:33:30 BoogieIcfgContainer [2021-07-06 20:33:30,960 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-07-06 20:33:30,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-06 20:33:30,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-06 20:33:30,961 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-06 20:33:30,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.07 08:32:30" (3/4) ... [2021-07-06 20:33:30,963 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-07-06 20:33:30,987 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-06 20:33:30,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-06 20:33:30,987 INFO L168 Benchmark]: Toolchain (without parser) took 61483.85 ms. Allocated memory was 52.4 MB in the beginning and 109.1 MB in the end (delta: 56.6 MB). Free memory was 29.3 MB in the beginning and 79.1 MB in the end (delta: -49.8 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-07-06 20:33:30,988 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.1 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:33:30,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.84 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 29.0 MB in the beginning and 42.0 MB in the end (delta: -13.0 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:33:30,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 67.1 MB. Free memory was 41.8 MB in the beginning and 38.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:33:30,993 INFO L168 Benchmark]: Boogie Preprocessor took 19.33 ms. Allocated memory is still 67.1 MB. Free memory was 38.9 MB in the beginning and 36.8 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:33:30,993 INFO L168 Benchmark]: RCFGBuilder took 558.21 ms. Allocated memory is still 67.1 MB. Free memory was 36.8 MB in the beginning and 37.2 MB in the end (delta: -456.6 kB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-07-06 20:33:30,993 INFO L168 Benchmark]: BuchiAutomizer took 60490.06 ms. Allocated memory was 67.1 MB in the beginning and 109.1 MB in the end (delta: 41.9 MB). Free memory was 36.5 MB in the beginning and 81.2 MB in the end (delta: -44.6 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.1 GB. [2021-07-06 20:33:30,994 INFO L168 Benchmark]: Witness Printer took 26.27 ms. Allocated memory is still 109.1 MB. Free memory was 81.2 MB in the beginning and 79.1 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-06 20:33:30,995 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.13 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.1 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.84 ms. Allocated memory was 52.4 MB in the beginning and 67.1 MB in the end (delta: 14.7 MB). Free memory was 29.0 MB in the beginning and 42.0 MB in the end (delta: -13.0 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.64 ms. Allocated memory is still 67.1 MB. Free memory was 41.8 MB in the beginning and 38.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.33 ms. Allocated memory is still 67.1 MB. Free memory was 38.9 MB in the beginning and 36.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 558.21 ms. Allocated memory is still 67.1 MB. Free memory was 36.8 MB in the beginning and 37.2 MB in the end (delta: -456.6 kB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 60490.06 ms. Allocated memory was 67.1 MB in the beginning and 109.1 MB in the end (delta: 41.9 MB). Free memory was 36.5 MB in the beginning and 81.2 MB in the end (delta: -44.6 MB). Peak memory consumption was 59.2 MB. Max. memory is 16.1 GB. * Witness Printer took 26.27 ms. Allocated memory is still 109.1 MB. Free memory was 81.2 MB in the beginning and 79.1 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 5 locations. The remainder module has 129 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 60.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 60.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 24.1ms AutomataMinimizationTime, 2 MinimizatonAttempts, 59 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 129 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 241 SDtfs, 372 SDslu, 272 SDs, 0 SdLazy, 70 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 67.4ms 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: 179]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e492096=0, NULL=0, NULL=0, NULL=0, NULL=23514, NULL=0, NULL=1, NULL=23535, retValue_acc=0, NULL=23524, NULL=23529, NULL=23528, methaneLevelCritical=0, NULL=23533, NULL=23521, tmp=1, NULL=0, NULL=23511, NULL=0, NULL=0, tmp___1=0, NULL=23522, NULL=0, NULL=0, NULL=0, NULL=23512, cleanupTimeShifts=4, tmp=0, switchedOnBeforeTS=0, NULL=23513, NULL=23516, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17bf37a1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b25171f=0, NULL=23531, \result=0, NULL=0, NULL=0, NULL=0, NULL=0, systemActive=1, waterLevel=1, \result=1, NULL=0, NULL=0, NULL=23510, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d7f83d1=0, tmp___0=0, NULL=23509, \result=1, retValue_acc=1, head=0, pumpRunning=0, \result=0, tmp___0=0, NULL=23532, NULL=23526, tmp=1, NULL=0, NULL=0, NULL=0, NULL=23520, retValue_acc=1, NULL=23523, NULL=0, NULL=0, NULL=23534, NULL=0, NULL=0, NULL=23508, NULL=0, tmp___2=72, NULL=0, splverifierCounter=0, NULL=0, NULL=23527, NULL=23519, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4927412e=0, NULL=23530, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e9c334d=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42b94a6=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5550e911=72, NULL=23515, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52e86806=0, NULL=0, NULL=0, NULL=23518, NULL=0, NULL=23517, NULL=23525, retValue_acc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L240] int pumpRunning = 0; [L241] int systemActive = 1; [L386] int cleanupTimeShifts = 4; [L485] int switchedOnBeforeTS ; [L703] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L461] int retValue_acc ; [L462] int tmp ; [L157] int retValue_acc ; [L160] retValue_acc = 1 [L161] return (retValue_acc); [L468] tmp = valid_product() [L470] COND TRUE \read(tmp) [L490] switchedOnBeforeTS = 0 [L170] int splverifierCounter ; [L171] int tmp ; [L172] int tmp___0 ; [L173] int tmp___1 ; [L174] int tmp___2 ; [L177] splverifierCounter = 0 Loop: [L179] COND TRUE 1 [L181] COND TRUE splverifierCounter < 4 [L187] tmp = __VERIFIER_nondet_int() [L189] COND FALSE !(\read(tmp)) [L197] tmp___0 = __VERIFIER_nondet_int() [L199] COND FALSE !(\read(tmp___0)) [L207] tmp___2 = __VERIFIER_nondet_int() [L209] COND TRUE \read(tmp___2) [L381] systemActive = 1 [L333] int retValue_acc ; [L336] retValue_acc = pumpRunning [L337] return (retValue_acc); [L499] switchedOnBeforeTS = isPumpRunning() [L252] COND FALSE !(\read(pumpRunning)) [L259] COND TRUE \read(systemActive) [L281] int tmp ; [L284] COND FALSE !(\read(pumpRunning)) [L505] int tmp ; [L506] int tmp___0 ; [L119] int retValue_acc ; [L122] retValue_acc = waterLevel [L123] return (retValue_acc); [L510] tmp = getWaterLevel() [L512] COND TRUE tmp != 2 [L333] int retValue_acc ; [L336] retValue_acc = pumpRunning [L337] return (retValue_acc); [L514] tmp___0 = isPumpRunning() [L516] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-07-06 20:33:31,036 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...