./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product60.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product60.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5628f313afbfffa53e61454ca424855ee3b0eb7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:14:56,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:14:56,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:14:56,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:14:56,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:14:56,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:14:56,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:14:56,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:14:56,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:14:56,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:14:56,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:14:56,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:14:56,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:14:56,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:14:56,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:14:56,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:14:56,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:14:56,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:14:56,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:14:56,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:14:56,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:14:56,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:14:56,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:14:56,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:14:56,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:14:56,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:14:56,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:14:56,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:14:56,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:14:56,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:14:56,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:14:56,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:14:56,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:14:56,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:14:56,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:14:56,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:14:56,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:14:56,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:14:56,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:14:56,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:14:56,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:14:56,580 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:14:56,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:14:56,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:14:56,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:14:56,593 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:14:56,593 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:14:56,594 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:14:56,594 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:14:56,594 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:14:56,594 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:14:56,594 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:14:56,595 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:14:56,595 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:14:56,595 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:14:56,595 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:14:56,595 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:14:56,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:14:56,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:14:56,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:14:56,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:14:56,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:14:56,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:14:56,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:14:56,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:14:56,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:14:56,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:14:56,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:14:56,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:14:56,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:14:56,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:14:56,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:14:56,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:14:56,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:14:56,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:14:56,599 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:14:56,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:14:56,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:14:56,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:14:56,608 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan 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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> e5628f313afbfffa53e61454ca424855ee3b0eb7 [2019-11-26 02:14:56,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:14:56,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:14:56,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:14:56,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:14:56,796 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:14:56,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product60.cil.c [2019-11-26 02:14:56,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/data/53f28180b/6f7084b9e00e4d1aa7d26564d4d10f0c/FLAG4ec2c377f [2019-11-26 02:14:57,246 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:14:57,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/sv-benchmarks/c/product-lines/minepump_spec4_product60.cil.c [2019-11-26 02:14:57,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/data/53f28180b/6f7084b9e00e4d1aa7d26564d4d10f0c/FLAG4ec2c377f [2019-11-26 02:14:57,269 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/data/53f28180b/6f7084b9e00e4d1aa7d26564d4d10f0c [2019-11-26 02:14:57,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:14:57,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:14:57,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:14:57,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:14:57,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:14:57,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:57,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b083bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57, skipping insertion in model container [2019-11-26 02:14:57,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:57,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:14:57,332 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:14:57,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:14:57,786 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:14:57,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:14:57,937 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:14:57,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57 WrapperNode [2019-11-26 02:14:57,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:14:57,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:14:57,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:14:57,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:14:57,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:57,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:14:58,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:14:58,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:14:58,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:14:58,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... [2019-11-26 02:14:58,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:14:58,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:14:58,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:14:58,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:14:58,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:14:58,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:14:58,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:14:58,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:14:58,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:15:00,544 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:15:00,545 INFO L284 CfgBuilder]: Removed 198 assume(true) statements. [2019-11-26 02:15:00,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:15:00 BoogieIcfgContainer [2019-11-26 02:15:00,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:15:00,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:15:00,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:15:00,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:15:00,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:14:57" (1/3) ... [2019-11-26 02:15:00,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ea2204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:15:00, skipping insertion in model container [2019-11-26 02:15:00,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:14:57" (2/3) ... [2019-11-26 02:15:00,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ea2204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:15:00, skipping insertion in model container [2019-11-26 02:15:00,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:15:00" (3/3) ... [2019-11-26 02:15:00,554 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product60.cil.c [2019-11-26 02:15:00,562 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:15:00,568 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 02:15:00,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 02:15:00,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:15:00,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:15:00,604 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:15:00,604 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:15:00,604 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:15:00,604 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:15:00,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:15:00,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:15:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 02:15:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:15:00,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:15:00,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:15:00,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:15:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:15:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2083159275, now seen corresponding path program 1 times [2019-11-26 02:15:00,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:15:00,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506702738] [2019-11-26 02:15:00,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:15:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:15:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:15:00,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506702738] [2019-11-26 02:15:00,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:15:00,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:15:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750547850] [2019-11-26 02:15:00,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:15:00,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:15:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:15:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:15:00,901 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-11-26 02:15:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:15:00,917 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2019-11-26 02:15:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:15:00,918 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-26 02:15:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:15:00,924 INFO L225 Difference]: With dead ends: 44 [2019-11-26 02:15:00,924 INFO L226 Difference]: Without dead ends: 21 [2019-11-26 02:15:00,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:15:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-26 02:15:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-26 02:15:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-26 02:15:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-26 02:15:00,954 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 7 [2019-11-26 02:15:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:15:00,955 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-26 02:15:00,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:15:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-26 02:15:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:15:00,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:15:00,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:15:00,956 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:15:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:15:00,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1481431789, now seen corresponding path program 1 times [2019-11-26 02:15:00,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:15:00,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857813458] [2019-11-26 02:15:00,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:15:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:15:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:15:01,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857813458] [2019-11-26 02:15:01,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:15:01,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:15:01,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623901310] [2019-11-26 02:15:01,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:15:01,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:15:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:15:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:15:01,170 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-26 02:15:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:15:01,261 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-11-26 02:15:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:15:01,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:15:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:15:01,262 INFO L225 Difference]: With dead ends: 53 [2019-11-26 02:15:01,262 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 02:15:01,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:15:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 02:15:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-11-26 02:15:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-26 02:15:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-26 02:15:01,268 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2019-11-26 02:15:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:15:01,268 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-26 02:15:01,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:15:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-26 02:15:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:15:01,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:15:01,269 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:15:01,269 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:15:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:15:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 547533829, now seen corresponding path program 1 times [2019-11-26 02:15:01,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:15:01,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238640171] [2019-11-26 02:15:01,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:15:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:15:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:15:01,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238640171] [2019-11-26 02:15:01,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960424577] [2019-11-26 02:15:01,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:15:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:15:01,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-26 02:15:01,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:15:01,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:01,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,215 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2019-11-26 02:15:02,358 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-26 02:15:02,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:15:02,455 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:15:02,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:15:02,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:15:03,060 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 19 [2019-11-26 02:15:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:15:03,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108729308] [2019-11-26 02:15:03,106 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 02:15:03,106 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:15:03,111 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:15:03,116 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:15:03,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:15:11,093 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 02:15:12,829 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 02:15:13,010 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 02:15:13,670 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 667 DAG size of output: 609 [2019-11-26 02:15:14,818 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:15:17,565 WARN L192 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 401 DAG size of output: 215 [2019-11-26 02:15:21,477 WARN L192 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 02:15:22,420 WARN L192 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 148 [2019-11-26 02:15:24,663 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 389 DAG size of output: 293 [2019-11-26 02:15:24,735 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:15:24,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:15:24,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2019-11-26 02:15:24,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158654133] [2019-11-26 02:15:24,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 02:15:24,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:15:24,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 02:15:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:15:24,737 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 16 states. [2019-11-26 02:15:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:15:24,913 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-26 02:15:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:15:24,913 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-11-26 02:15:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:15:24,914 INFO L225 Difference]: With dead ends: 34 [2019-11-26 02:15:24,914 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:15:24,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-26 02:15:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:15:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:15:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:15:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:15:24,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-11-26 02:15:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:15:24,915 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:15:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 02:15:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:15:24,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:15:25,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:15:25,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:15:25,910 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 578) no Hoare annotation was computed. [2019-11-26 02:15:25,910 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 578) no Hoare annotation was computed. [2019-11-26 02:15:25,911 INFO L440 ceAbstractionStarter]: At program point L841(lines 840 889) the Hoare annotation is: (let ((.cse5 (= 1 ~waterLevel~0)) (.cse6 (= ~pumpRunning~0 0))) (or (and (let ((.cse3 (= 0 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse0 (= 1 ~systemActive~0))) (let ((.cse4 (or (and (or (and .cse6 .cse3) (and .cse6 .cse1)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse0 .cse6))) (.cse2 (= 2 ~waterLevel~0))) (or (and (or .cse0 .cse1) .cse2 (= ~pumpRunning~0 1) (not .cse3)) (and .cse4 .cse5) (and .cse4 .cse2)))) (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0)) (and .cse5 (= 1 ULTIMATE.start_main_~tmp~0) .cse6))) [2019-11-26 02:15:25,911 INFO L444 ceAbstractionStarter]: For program point L578(line 578) no Hoare annotation was computed. [2019-11-26 02:15:25,911 INFO L444 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2019-11-26 02:15:25,911 INFO L444 ceAbstractionStarter]: For program point L578-2(line 578) no Hoare annotation was computed. [2019-11-26 02:15:25,911 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-26 02:15:25,912 INFO L440 ceAbstractionStarter]: At program point L90-2(lines 90 104) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4)) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,912 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:15:25,912 INFO L440 ceAbstractionStarter]: At program point L556(lines 556 569) the Hoare annotation is: (and (let ((.cse3 (= 0 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse0 (= 1 ~systemActive~0))) (let ((.cse4 (let ((.cse5 (= ~pumpRunning~0 0))) (or (and (or (and .cse5 .cse3) (and .cse5 .cse1)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse0 .cse5)))) (.cse2 (= 2 ~waterLevel~0))) (or (and (or .cse0 .cse1) .cse2 (= ~pumpRunning~0 1) (not .cse3)) (and .cse4 (= 1 ~waterLevel~0)) (and .cse4 .cse2)))) (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0)) [2019-11-26 02:15:25,912 INFO L440 ceAbstractionStarter]: At program point L556-1(lines 1 1000) the Hoare annotation is: (let ((.cse5 (= 1 ~waterLevel~0)) (.cse6 (= ~pumpRunning~0 0))) (or (and (let ((.cse3 (= 0 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse0 (= 1 ~systemActive~0))) (let ((.cse4 (or (and (or (and .cse6 .cse3) (and .cse6 .cse1)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse0 .cse6))) (.cse2 (= 2 ~waterLevel~0))) (or (and (or .cse0 .cse1) .cse2 (= ~pumpRunning~0 1) (not .cse3)) (and .cse4 .cse5) (and .cse4 .cse2)))) (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0)) (and .cse5 (= 1 ULTIMATE.start_main_~tmp~0) .cse6))) [2019-11-26 02:15:25,912 INFO L440 ceAbstractionStarter]: At program point L556-2(lines 556 569) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4)) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,912 INFO L440 ceAbstractionStarter]: At program point L556-3(lines 1 1000) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4)) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,912 INFO L440 ceAbstractionStarter]: At program point L556-4(lines 556 569) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4)) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,913 INFO L440 ceAbstractionStarter]: At program point L556-5(lines 1 1000) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4)) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,913 INFO L440 ceAbstractionStarter]: At program point L94(lines 94 98) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0 (<= 1 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4)) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,913 INFO L440 ceAbstractionStarter]: At program point L890(lines 839 891) the Hoare annotation is: (let ((.cse0 (= ~pumpRunning~0 0))) (or (and (= 1 ~waterLevel~0) .cse0) (and (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~4 ~waterLevel~0) (let ((.cse4 (= 0 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~tmp___1~0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= 2 ~waterLevel~0))) (or (and (or .cse1 .cse2) .cse3 (= ~pumpRunning~0 1) (not .cse4)) (and (or (and (or (and .cse0 .cse4) (and .cse0 .cse2)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648))) (and .cse1 .cse0)) .cse3)))))) [2019-11-26 02:15:25,913 INFO L444 ceAbstractionStarter]: For program point L560(lines 560 566) no Hoare annotation was computed. [2019-11-26 02:15:25,913 INFO L444 ceAbstractionStarter]: For program point L560-2(lines 560 566) no Hoare annotation was computed. [2019-11-26 02:15:25,913 INFO L444 ceAbstractionStarter]: For program point L560-4(lines 560 566) no Hoare annotation was computed. [2019-11-26 02:15:25,913 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 578) no Hoare annotation was computed. [2019-11-26 02:15:25,914 INFO L440 ceAbstractionStarter]: At program point L165(lines 165 172) the Hoare annotation is: (and (or (= 1 ~systemActive~0) (and (or (= 0 ULTIMATE.start_test_~tmp___1~0) (= 0 ~systemActive~0)) (<= ULTIMATE.start_test_~tmp___1~0 2147483647) (<= 0 (+ ULTIMATE.start_test_~tmp___1~0 2147483648)))) (= 1 ~waterLevel~0) (= 1 ULTIMATE.start_main_~tmp~0) (= ~pumpRunning~0 0)) [2019-11-26 02:15:25,914 INFO L447 ceAbstractionStarter]: At program point L165-1(lines 165 172) the Hoare annotation is: true [2019-11-26 02:15:25,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:15:25 BoogieIcfgContainer [2019-11-26 02:15:25,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:15:25,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:15:25,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:15:25,948 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:15:25,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:15:00" (3/4) ... [2019-11-26 02:15:25,966 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:15:25,998 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2019-11-26 02:15:26,000 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2019-11-26 02:15:26,001 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-26 02:15:26,003 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-26 02:15:26,004 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:15:26,006 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:15:26,007 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:15:26,149 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7c636ff1-bca4-485b-bcba-b911edafc706/bin/utaipan/witness.graphml [2019-11-26 02:15:26,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:15:26,151 INFO L168 Benchmark]: Toolchain (without parser) took 28878.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.7 MB). Free memory was 940.7 MB in the beginning and 862.9 MB in the end (delta: 77.8 MB). Peak memory consumption was 492.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,151 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:15:26,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,152 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,152 INFO L168 Benchmark]: Boogie Preprocessor took 60.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,153 INFO L168 Benchmark]: RCFGBuilder took 2433.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,153 INFO L168 Benchmark]: TraceAbstraction took 25400.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.1 GB in the beginning and 876.3 MB in the end (delta: 196.6 MB). Peak memory consumption was 464.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,153 INFO L168 Benchmark]: Witness Printer took 201.89 ms. Allocated memory is still 1.4 GB. Free memory was 876.3 MB in the beginning and 862.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:15:26,156 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 666.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2433.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25400.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.4 MB). Free memory was 1.1 GB in the beginning and 876.3 MB in the end (delta: 196.6 MB). Peak memory consumption was 464.0 MB. Max. memory is 11.5 GB. * Witness Printer took 201.89 ms. Allocated memory is still 1.4 GB. Free memory was 876.3 MB in the beginning and 862.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 578]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 578]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 578]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((1 == systemActive || (((0 == tmp___1 || 0 == systemActive) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648)) && 1 == waterLevel) && 1 == tmp) && pumpRunning == 0 - InvariantResult [Line: 556]: Loop Invariant Derived loop invariant: ((((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 1 == waterLevel)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel)) && tmp == waterLevel - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 1 == waterLevel)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel)) && tmp == waterLevel) || ((1 == waterLevel && 1 == tmp) && pumpRunning == 0) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((1 == waterLevel && pumpRunning == 0) && 1 <= tmp) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: 556]: Loop Invariant Derived loop invariant: ((1 == waterLevel && pumpRunning == 0) && 1 <= tmp) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: (((((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 1 == waterLevel)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel)) && tmp == waterLevel) || ((1 == waterLevel && 1 == tmp) && pumpRunning == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == waterLevel && pumpRunning == 0) && 1 <= tmp) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 556]: Loop Invariant Derived loop invariant: ((1 == waterLevel && pumpRunning == 0) && 1 <= tmp) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == waterLevel && pumpRunning == 0) && 1 <= tmp) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: ((1 == waterLevel && pumpRunning == 0) && 1 <= tmp) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: 839]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) || (tmp == waterLevel && (((((1 == systemActive || 0 == tmp___1) && 2 == waterLevel) && pumpRunning == 1) && !(0 == systemActive)) || ((((((pumpRunning == 0 && 0 == systemActive) || (pumpRunning == 0 && 0 == tmp___1)) && tmp___1 <= 2147483647) && 0 <= tmp___1 + 2147483648) || (1 == systemActive && pumpRunning == 0)) && 2 == waterLevel))) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. Result: SAFE, OverallTime: 25.3s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 58 SDtfs, 54 SDslu, 59 SDs, 0 SdLazy, 63 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 34 NumberOfFragments, 826 HoareAnnotationTreeSize, 13 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 315 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 4692 SizeOfPredicates, 76 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...