./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product56.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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_product56.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 d987d174a4a8df6e0aafdb6d8ee456b5bda233ea ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:07:09,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:07:09,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:07:09,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:07:09,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:07:09,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:07:09,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:07:09,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:07:09,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:07:09,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:07:09,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:07:09,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:07:09,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:07:09,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:07:09,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:07:09,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:07:09,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:07:09,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:07:09,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:07:09,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:07:09,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:07:09,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:07:09,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:07:09,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:07:09,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:07:09,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:07:09,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:07:09,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:07:09,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:07:09,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:07:09,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:07:09,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:07:09,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:07:09,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:07:09,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:07:09,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:07:09,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:07:09,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:07:09,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:07:09,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:07:09,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:07:09,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:07:09,260 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:07:09,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:07:09,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:07:09,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:07:09,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:07:09,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:07:09,261 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:07:09,261 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:07:09,261 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:07:09,261 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:07:09,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:07:09,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:07:09,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:07:09,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:07:09,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:07:09,264 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:07:09,264 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 -> d987d174a4a8df6e0aafdb6d8ee456b5bda233ea [2021-08-31 04:07:09,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:07:09,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:07:09,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:07:09,530 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:07:09,531 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:07:09,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product56.cil.c [2021-08-31 04:07:09,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9872e6ca6/b5c196ae6c8344108d254e121496cc44/FLAGe34006cbe [2021-08-31 04:07:09,944 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:07:09,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product56.cil.c [2021-08-31 04:07:09,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9872e6ca6/b5c196ae6c8344108d254e121496cc44/FLAGe34006cbe [2021-08-31 04:07:09,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9872e6ca6/b5c196ae6c8344108d254e121496cc44 [2021-08-31 04:07:09,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:07:09,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:07:09,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:07:09,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:07:09,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:07:09,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:07:09" (1/1) ... [2021-08-31 04:07:09,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c256a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:09, skipping insertion in model container [2021-08-31 04:07:09,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:07:09" (1/1) ... [2021-08-31 04:07:09,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:07:10,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:07:10,160 WARN L228 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_product56.cil.c[17014,17027] [2021-08-31 04:07:10,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:07:10,171 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:07:10,211 WARN L228 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_product56.cil.c[17014,17027] [2021-08-31 04:07:10,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:07:10,226 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:07:10,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10 WrapperNode [2021-08-31 04:07:10,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:07:10,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:07:10,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:07:10,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:07:10,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:07:10,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:07:10,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:07:10,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:07:10,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:07:10,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:07:10,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:07:10,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:07:10,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (1/1) ... [2021-08-31 04:07:10,321 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:07:10,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:07:10,361 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-08-31 04:07:10,371 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-08-31 04:07:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:07:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:07:10,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:07:10,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:07:10,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:07:10,828 INFO L299 CfgBuilder]: Removed 282 assume(true) statements. [2021-08-31 04:07:10,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:07:10 BoogieIcfgContainer [2021-08-31 04:07:10,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:07:10,830 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:07:10,830 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:07:10,832 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:07:10,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:07:10,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:07:09" (1/3) ... [2021-08-31 04:07:10,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10cc49d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:07:10, skipping insertion in model container [2021-08-31 04:07:10,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:07:10,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:07:10" (2/3) ... [2021-08-31 04:07:10,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10cc49d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:07:10, skipping insertion in model container [2021-08-31 04:07:10,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:07:10,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:07:10" (3/3) ... [2021-08-31 04:07:10,835 INFO L389 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product56.cil.c [2021-08-31 04:07:10,862 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:07:10,863 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:07:10,863 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:07:10,863 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:07:10,863 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:07:10,863 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:07:10,863 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:07:10,863 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:07:10,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 188 states, 187 states have (on average 1.5401069518716577) internal successors, (288), 187 states have internal predecessors, (288), 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-08-31 04:07:10,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2021-08-31 04:07:10,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:07:10,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:07:10,904 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 04:07:10,904 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:07:10,904 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:07:10,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 188 states, 187 states have (on average 1.5401069518716577) internal successors, (288), 187 states have internal predecessors, (288), 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-08-31 04:07:10,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 123 [2021-08-31 04:07:10,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:07:10,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:07:10,912 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 04:07:10,912 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:07:10,917 INFO L791 eck$LassoCheckResult]: Stem: 173#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~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(13);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string74.base, #t~string74.offset, 1);call write~init~int(77, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(101, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(116, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(104, #t~string74.base, 4 + #t~string74.offset, 1);call write~init~int(58, #t~string74.base, 5 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 6 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string76.base, #t~string76.offset, 1);call write~init~int(82, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(73, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(84, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 4 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string78.base, #t~string78.offset, 1);call write~init~int(75, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 2 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string80.base, #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 1 + #t~string80.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 59#L-1true havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 147#L1000true havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 142#L1008true main_#t~ret70 := valid_product_#res;main_~tmp~10 := main_#t~ret70;havoc main_#t~ret70; 18#L852true assume 0 != main_~tmp~10; 66#L826true havoc test_#t~nondet64, test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 67#L749-1true [2021-08-31 04:07:10,917 INFO L793 eck$LassoCheckResult]: Loop: 67#L749-1true assume !false; 82#L681true assume test_~splverifierCounter~0 < 4; 99#L682true test_~tmp~8 := test_#t~nondet64;havoc test_#t~nondet64; 71#L690true assume !(0 != test_~tmp~8); 8#L690-1true test_~tmp___0~2 := test_#t~nondet65;havoc test_#t~nondet65; 77#L700true assume !(0 != test_~tmp___0~2); 85#L700-1true test_~tmp___2~0 := test_#t~nondet66;havoc test_#t~nondet66; 95#L710true assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 186#L718-1true assume !(0 != ~pumpRunning~0); 183#L62true assume !(0 != ~systemActive~0); 24#L69true havoc __utac_acc__Specification4_spec__1_#t~ret68, __utac_acc__Specification4_spec__1_#t~ret69, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 60#L950true __utac_acc__Specification4_spec__1_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret68;havoc __utac_acc__Specification4_spec__1_#t~ret68; 4#L749true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 67#L749-1true [2021-08-31 04:07:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 1 times [2021-08-31 04:07:10,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:10,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137727769] [2021-08-31 04:07:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:10,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:11,049 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:07:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:11,120 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:07:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1666938228, now seen corresponding path program 1 times [2021-08-31 04:07:11,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:11,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800498733] [2021-08-31 04:07:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:11,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:07:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:07:11,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:07:11,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800498733] [2021-08-31 04:07:11,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800498733] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:07:11,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:07:11,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:07:11,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466287712] [2021-08-31 04:07:11,194 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:07:11,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:07:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:07:11,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:07:11,215 INFO L87 Difference]: Start difference. First operand has 188 states, 187 states have (on average 1.5401069518716577) internal successors, (288), 187 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:07:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:07:11,796 INFO L93 Difference]: Finished difference Result 370 states and 552 transitions. [2021-08-31 04:07:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:07:11,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 552 transitions. [2021-08-31 04:07:11,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 242 [2021-08-31 04:07:11,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 356 states and 537 transitions. [2021-08-31 04:07:11,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2021-08-31 04:07:11,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2021-08-31 04:07:11,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 537 transitions. [2021-08-31 04:07:11,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:07:11,813 INFO L681 BuchiCegarLoop]: Abstraction has 356 states and 537 transitions. [2021-08-31 04:07:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 537 transitions. [2021-08-31 04:07:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2021-08-31 04:07:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 354 states have (on average 1.5084745762711864) internal successors, (534), 353 states have internal predecessors, (534), 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-08-31 04:07:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2021-08-31 04:07:11,841 INFO L704 BuchiCegarLoop]: Abstraction has 354 states and 534 transitions. [2021-08-31 04:07:11,841 INFO L587 BuchiCegarLoop]: Abstraction has 354 states and 534 transitions. [2021-08-31 04:07:11,841 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:07:11,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 534 transitions. [2021-08-31 04:07:11,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 240 [2021-08-31 04:07:11,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:07:11,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:07:11,845 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 04:07:11,845 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:07:11,845 INFO L791 eck$LassoCheckResult]: Stem: 748#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~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(13);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string74.base, #t~string74.offset, 1);call write~init~int(77, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(101, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(116, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(104, #t~string74.base, 4 + #t~string74.offset, 1);call write~init~int(58, #t~string74.base, 5 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 6 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string76.base, #t~string76.offset, 1);call write~init~int(82, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(73, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(84, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 4 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string78.base, #t~string78.offset, 1);call write~init~int(75, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 2 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string80.base, #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 1 + #t~string80.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 661#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 662#L1000 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 739#L1008 main_#t~ret70 := valid_product_#res;main_~tmp~10 := main_#t~ret70;havoc main_#t~ret70; 597#L852 assume 0 != main_~tmp~10; 598#L826 havoc test_#t~nondet64, test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 568#L749-1 [2021-08-31 04:07:11,845 INFO L793 eck$LassoCheckResult]: Loop: 568#L749-1 assume !false; 674#L681 assume test_~splverifierCounter~0 < 4; 690#L682 test_~tmp~8 := test_#t~nondet64;havoc test_#t~nondet64; 814#L690 assume !(0 != test_~tmp~8); 812#L690-1 test_~tmp___0~2 := test_#t~nondet65;havoc test_#t~nondet65; 811#L700 assume !(0 != test_~tmp___0~2); 809#L700-1 test_~tmp___2~0 := test_#t~nondet66;havoc test_#t~nondet66; 808#L710 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 702#L718-1 assume !(0 != ~pumpRunning~0); 750#L62 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret9, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 732#L146 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret8, processEnvironment__wrappee__lowWaterSensor_~tmp~1;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~1; 666#L120-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret7, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 668#L94-3 assume !(0 == ~pumpRunning~0); 613#L69 havoc __utac_acc__Specification4_spec__1_#t~ret68, __utac_acc__Specification4_spec__1_#t~ret69, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 614#L950 __utac_acc__Specification4_spec__1_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret68;havoc __utac_acc__Specification4_spec__1_#t~ret68; 567#L749 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 568#L749-1 [2021-08-31 04:07:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 2 times [2021-08-31 04:07:11,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:11,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560624683] [2021-08-31 04:07:11,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:11,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:11,897 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:07:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:11,943 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:07:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:11,944 INFO L82 PathProgramCache]: Analyzing trace with hash 558894454, now seen corresponding path program 1 times [2021-08-31 04:07:11,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:11,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686982230] [2021-08-31 04:07:11,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:11,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:07:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:07:11,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:07:11,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686982230] [2021-08-31 04:07:11,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686982230] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:07:11,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:07:11,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:07:11,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133462898] [2021-08-31 04:07:11,958 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:07:11,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:07:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:07:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:07:11,959 INFO L87 Difference]: Start difference. First operand 354 states and 534 transitions. cyclomatic complexity: 183 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-08-31 04:07:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:07:12,217 INFO L93 Difference]: Finished difference Result 365 states and 514 transitions. [2021-08-31 04:07:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:07:12,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 514 transitions. [2021-08-31 04:07:12,221 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 255 [2021-08-31 04:07:12,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 365 states and 514 transitions. [2021-08-31 04:07:12,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2021-08-31 04:07:12,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2021-08-31 04:07:12,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 514 transitions. [2021-08-31 04:07:12,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:07:12,225 INFO L681 BuchiCegarLoop]: Abstraction has 365 states and 514 transitions. [2021-08-31 04:07:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 514 transitions. [2021-08-31 04:07:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-08-31 04:07:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 365 states have (on average 1.4082191780821918) internal successors, (514), 364 states have internal predecessors, (514), 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-08-31 04:07:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 514 transitions. [2021-08-31 04:07:12,255 INFO L704 BuchiCegarLoop]: Abstraction has 365 states and 514 transitions. [2021-08-31 04:07:12,255 INFO L587 BuchiCegarLoop]: Abstraction has 365 states and 514 transitions. [2021-08-31 04:07:12,255 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:07:12,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 514 transitions. [2021-08-31 04:07:12,257 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 255 [2021-08-31 04:07:12,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:07:12,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:07:12,257 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-31 04:07:12,257 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-08-31 04:07:12,258 INFO L791 eck$LassoCheckResult]: Stem: 1462#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~string12.base, #t~string12.offset := #Ultimate.allocOnStack(13);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(110, #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(4);call write~init~int(79, #t~string16.base, #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 1 + #t~string16.offset, 1);call write~init~int(102, #t~string16.base, 2 + #t~string16.offset, 1);call write~init~int(0, #t~string16.base, 3 + #t~string16.offset, 1);call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string18.base, #t~string18.offset, 1);call write~init~int(80, #t~string18.base, 1 + #t~string18.offset, 1);call write~init~int(117, #t~string18.base, 2 + #t~string18.offset, 1);call write~init~int(109, #t~string18.base, 3 + #t~string18.offset, 1);call write~init~int(112, #t~string18.base, 4 + #t~string18.offset, 1);call write~init~int(58, #t~string18.base, 5 + #t~string18.offset, 1);call write~init~int(0, #t~string18.base, 6 + #t~string18.offset, 1);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string20.base, #t~string20.offset, 1);call write~init~int(110, #t~string20.base, 1 + #t~string20.offset, 1);call write~init~int(0, #t~string20.base, 2 + #t~string20.offset, 1);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(4);call write~init~int(79, #t~string22.base, #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 1 + #t~string22.offset, 1);call write~init~int(102, #t~string22.base, 2 + #t~string22.offset, 1);call write~init~int(0, #t~string22.base, 3 + #t~string22.offset, 1);call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(3);call write~init~int(41, #t~string24.base, #t~string24.offset, 1);call write~init~int(32, #t~string24.base, 1 + #t~string24.offset, 1);call write~init~int(0, #t~string24.base, 2 + #t~string24.offset, 1);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string26.base, #t~string26.offset, 1);call write~init~int(0, #t~string26.base, 1 + #t~string26.offset, 1);call #t~string47.base, #t~string47.offset := #Ultimate.allocOnStack(30);call #t~string48.base, #t~string48.offset := #Ultimate.allocOnStack(9);call #t~string49.base, #t~string49.offset := #Ultimate.allocOnStack(21);call #t~string50.base, #t~string50.offset := #Ultimate.allocOnStack(30);call #t~string51.base, #t~string51.offset := #Ultimate.allocOnStack(9);call #t~string52.base, #t~string52.offset := #Ultimate.allocOnStack(21);call #t~string56.base, #t~string56.offset := #Ultimate.allocOnStack(30);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(9);call #t~string58.base, #t~string58.offset := #Ultimate.allocOnStack(25);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(30);call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(9);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(25);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(13);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(7);call write~init~int(44, #t~string74.base, #t~string74.offset, 1);call write~init~int(77, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(101, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(116, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(104, #t~string74.base, 4 + #t~string74.offset, 1);call write~init~int(58, #t~string74.base, 5 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 6 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(5);call write~init~int(67, #t~string76.base, #t~string76.offset, 1);call write~init~int(82, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(73, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(84, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 4 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(3);call write~init~int(79, #t~string78.base, #t~string78.offset, 1);call write~init~int(75, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 2 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(2);call write~init~int(41, #t~string80.base, #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 1 + #t~string80.offset, 1);~pumpRunning~0 := 0;~systemActive~0 := 1;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 1366#L-1 havoc main_#res;havoc main_#t~ret70, main_~retValue_acc~7, main_~tmp~10;havoc main_~retValue_acc~7;havoc main_~tmp~10; 1367#L1000 havoc valid_product_#res;havoc valid_product_~retValue_acc~13;havoc valid_product_~retValue_acc~13;valid_product_~retValue_acc~13 := 1;valid_product_#res := valid_product_~retValue_acc~13; 1448#L1008 main_#t~ret70 := valid_product_#res;main_~tmp~10 := main_#t~ret70;havoc main_#t~ret70; 1313#L852 assume 0 != main_~tmp~10; 1314#L826 havoc test_#t~nondet64, test_#t~nondet65, test_#t~nondet66, test_#t~nondet67, test_~splverifierCounter~0, test_~tmp~8, test_~tmp___0~2, test_~tmp___1~0, test_~tmp___2~0;havoc test_~splverifierCounter~0;havoc test_~tmp~8;havoc test_~tmp___0~2;havoc test_~tmp___1~0;havoc test_~tmp___2~0;test_~splverifierCounter~0 := 0; 1378#L749-1 [2021-08-31 04:07:12,258 INFO L793 eck$LassoCheckResult]: Loop: 1378#L749-1 assume !false; 1547#L681 assume test_~splverifierCounter~0 < 4; 1546#L682 test_~tmp~8 := test_#t~nondet64;havoc test_#t~nondet64; 1545#L690 assume !(0 != test_~tmp~8); 1543#L690-1 test_~tmp___0~2 := test_#t~nondet65;havoc test_#t~nondet65; 1542#L700 assume !(0 != test_~tmp___0~2); 1540#L700-1 test_~tmp___2~0 := test_#t~nondet66;havoc test_#t~nondet66; 1539#L710 assume 0 != test_~tmp___2~0;~systemActive~0 := 1; 1413#L718-1 assume !(0 != ~pumpRunning~0); 1505#L62 assume 0 != ~systemActive~0;havoc processEnvironment_#t~ret9, processEnvironment_~tmp~2;havoc processEnvironment_~tmp~2; 1535#L146 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__lowWaterSensor_#t~ret8, processEnvironment__wrappee__lowWaterSensor_~tmp~1;havoc processEnvironment__wrappee__lowWaterSensor_~tmp~1; 1534#L120-1 assume !(0 != ~pumpRunning~0);havoc processEnvironment__wrappee__highWaterSensor_#t~ret7, processEnvironment__wrappee__highWaterSensor_~tmp~0;havoc processEnvironment__wrappee__highWaterSensor_~tmp~0; 1532#L94-3 assume 0 == ~pumpRunning~0;havoc isHighWaterLevel_#res;havoc isHighWaterLevel_#t~ret27, isHighWaterLevel_~retValue_acc~2, isHighWaterLevel_~tmp~3, isHighWaterLevel_~tmp___0~0;havoc isHighWaterLevel_~retValue_acc~2;havoc isHighWaterLevel_~tmp~3;havoc isHighWaterLevel_~tmp___0~0;havoc isHighWaterSensorDry_#res;havoc isHighWaterSensorDry_~retValue_acc~10;havoc isHighWaterSensorDry_~retValue_acc~10; 1530#L958-3 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~10 := 1;isHighWaterSensorDry_#res := isHighWaterSensorDry_~retValue_acc~10; 1526#L963-3 isHighWaterLevel_#t~ret27 := isHighWaterSensorDry_#res;isHighWaterLevel_~tmp~3 := isHighWaterLevel_#t~ret27;havoc isHighWaterLevel_#t~ret27; 1522#L248-9 assume 0 != isHighWaterLevel_~tmp~3;isHighWaterLevel_~tmp___0~0 := 0; 1518#L248-11 isHighWaterLevel_~retValue_acc~2 := isHighWaterLevel_~tmp___0~0;isHighWaterLevel_#res := isHighWaterLevel_~retValue_acc~2; 1514#L254-3 processEnvironment__wrappee__highWaterSensor_#t~ret7 := isHighWaterLevel_#res;processEnvironment__wrappee__highWaterSensor_~tmp~0 := processEnvironment__wrappee__highWaterSensor_#t~ret7;havoc processEnvironment__wrappee__highWaterSensor_#t~ret7; 1509#L98-3 assume !(0 != processEnvironment__wrappee__highWaterSensor_~tmp~0); 1449#L69 havoc __utac_acc__Specification4_spec__1_#t~ret68, __utac_acc__Specification4_spec__1_#t~ret69, __utac_acc__Specification4_spec__1_~tmp~9, __utac_acc__Specification4_spec__1_~tmp___0~3;havoc __utac_acc__Specification4_spec__1_~tmp~9;havoc __utac_acc__Specification4_spec__1_~tmp___0~3;havoc getWaterLevel_#res;havoc getWaterLevel_~retValue_acc~9;havoc getWaterLevel_~retValue_acc~9;getWaterLevel_~retValue_acc~9 := ~waterLevel~0;getWaterLevel_#res := getWaterLevel_~retValue_acc~9; 1551#L950 __utac_acc__Specification4_spec__1_#t~ret68 := getWaterLevel_#res;__utac_acc__Specification4_spec__1_~tmp~9 := __utac_acc__Specification4_spec__1_#t~ret68;havoc __utac_acc__Specification4_spec__1_#t~ret68; 1549#L749 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~9); 1378#L749-1 [2021-08-31 04:07:12,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash 889506727, now seen corresponding path program 3 times [2021-08-31 04:07:12,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:12,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808087036] [2021-08-31 04:07:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:12,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:12,304 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:07:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:12,363 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:07:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:12,364 INFO L82 PathProgramCache]: Analyzing trace with hash 222495874, now seen corresponding path program 1 times [2021-08-31 04:07:12,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:12,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602972393] [2021-08-31 04:07:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:12,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:12,368 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:07:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:12,386 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:07:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:07:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1475801000, now seen corresponding path program 1 times [2021-08-31 04:07:12,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:07:12,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590721013] [2021-08-31 04:07:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:07:12,387 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:07:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:12,431 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:07:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:07:12,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:07:52,080 WARN L210 SmtUtils]: Spent 39.37s on a formula simplification. DAG size of input: 491 DAG size of output: 433 [2021-08-31 04:08:34,045 WARN L210 SmtUtils]: Spent 20.03s on a formula simplification that was a NOOP. DAG size: 433 [2021-08-31 04:08:34,139 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:08:34,141 INFO L158 Benchmark]: Toolchain (without parser) took 84170.27ms. Allocated memory was 54.5MB in the beginning and 107.0MB in the end (delta: 52.4MB). Free memory was 38.8MB in the beginning and 28.2MB in the end (delta: 10.5MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2021-08-31 04:08:34,141 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 44.0MB. Free memory was 26.9MB in the beginning and 26.9MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:08:34,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.50ms. Allocated memory is still 54.5MB. Free memory was 38.5MB in the beginning and 33.1MB in the end (delta: 5.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2021-08-31 04:08:34,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.13ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 28.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-31 04:08:34,143 INFO L158 Benchmark]: Boogie Preprocessor took 28.73ms. Allocated memory is still 54.5MB. Free memory was 28.3MB in the beginning and 24.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-31 04:08:34,144 INFO L158 Benchmark]: RCFGBuilder took 529.84ms. Allocated memory was 54.5MB in the beginning and 79.7MB in the end (delta: 25.2MB). Free memory was 24.8MB in the beginning and 45.7MB in the end (delta: -20.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-08-31 04:08:34,144 INFO L158 Benchmark]: BuchiAutomizer took 83309.74ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 45.7MB in the beginning and 28.2MB in the end (delta: 17.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2021-08-31 04:08:34,146 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.15ms. Allocated memory is still 44.0MB. Free memory was 26.9MB in the beginning and 26.9MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.50ms. Allocated memory is still 54.5MB. Free memory was 38.5MB in the beginning and 33.1MB in the end (delta: 5.4MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.13ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 28.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.73ms. Allocated memory is still 54.5MB. Free memory was 28.3MB in the beginning and 24.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 529.84ms. Allocated memory was 54.5MB in the beginning and 79.7MB in the end (delta: 25.2MB). Free memory was 24.8MB in the beginning and 45.7MB in the end (delta: -20.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 83309.74ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 45.7MB in the beginning and 28.2MB in the end (delta: 17.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * 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 3 locations. The remainder module has 365 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:08:34,219 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...