./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec4_product44.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_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/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 cd9d3373e3670d73493569b1c43b551709fc0f6c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:35:07,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:35:07,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:35:07,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:35:07,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:35:07,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:35:07,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:35:07,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:35:07,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:35:07,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:35:07,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:35:07,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:35:07,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:35:07,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:35:07,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:35:07,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:35:07,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:35:07,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:35:07,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:35:07,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:35:07,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:35:07,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:35:07,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:35:07,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:35:07,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:35:07,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:35:07,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:35:07,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:35:07,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:35:07,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:35:07,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:35:07,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:35:07,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:35:07,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:35:07,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:35:07,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:35:07,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:35:07,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:35:07,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:35:07,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:35:07,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:35:07,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:35:07,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:35:07,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:35:07,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:35:07,680 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:35:07,680 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:35:07,680 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:35:07,680 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:35:07,680 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:35:07,681 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:35:07,681 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:35:07,682 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:35:07,682 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:35:07,682 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:35:07,683 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:35:07,683 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:35:07,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:35:07,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:35:07,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:35:07,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:35:07,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:35:07,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:35:07,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:35:07,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:35:07,688 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:35:07,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:35:07,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:35:07,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:35:07,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:35:07,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:35:07,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:35:07,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:35:07,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:35:07,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:35:07,691 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:35:07,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:35:07,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:35:07,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:35:07,692 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_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/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 -> cd9d3373e3670d73493569b1c43b551709fc0f6c [2019-11-26 02:35:07,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:35:07,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:35:07,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:35:07,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:35:07,867 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:35:07,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2019-11-26 02:35:07,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/data/c41c214ef/2d15fa8669c24ae080f5f763360050da/FLAG9a68db3f3 [2019-11-26 02:35:08,381 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:35:08,382 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2019-11-26 02:35:08,401 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/data/c41c214ef/2d15fa8669c24ae080f5f763360050da/FLAG9a68db3f3 [2019-11-26 02:35:08,418 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/data/c41c214ef/2d15fa8669c24ae080f5f763360050da [2019-11-26 02:35:08,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:35:08,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:35:08,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:35:08,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:35:08,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:35:08,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:35:08" (1/1) ... [2019-11-26 02:35:08,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43664afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:08, skipping insertion in model container [2019-11-26 02:35:08,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:35:08" (1/1) ... [2019-11-26 02:35:08,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:35:08,501 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:35:08,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:35:08,910 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:35:09,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:35:09,057 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:35:09,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09 WrapperNode [2019-11-26 02:35:09,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:35:09,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:35:09,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:35:09,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:35:09,066 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:35:09" (1/1) ... [2019-11-26 02:35:09,092 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:35:09" (1/1) ... [2019-11-26 02:35:09,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:35:09,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:35:09,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:35:09,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:35:09,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... [2019-11-26 02:35:09,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:35:09,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:35:09,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:35:09,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:35:09,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/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:35:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:35:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:35:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:35:09,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:35:10,988 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:35:10,989 INFO L284 CfgBuilder]: Removed 120 assume(true) statements. [2019-11-26 02:35:10,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:10 BoogieIcfgContainer [2019-11-26 02:35:10,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:35:10,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:35:10,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:35:10,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:35:10,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:35:08" (1/3) ... [2019-11-26 02:35:10,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fd6803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:35:10, skipping insertion in model container [2019-11-26 02:35:10,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:35:09" (2/3) ... [2019-11-26 02:35:10,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fd6803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:35:10, skipping insertion in model container [2019-11-26 02:35:10,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:10" (3/3) ... [2019-11-26 02:35:11,000 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product44.cil.c [2019-11-26 02:35:11,009 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:35:11,015 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-26 02:35:11,024 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-26 02:35:11,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:35:11,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:35:11,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:35:11,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:35:11,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:35:11,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:35:11,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:35:11,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:35:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-11-26 02:35:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:35:11,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:11,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:35:11,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 935072699, now seen corresponding path program 1 times [2019-11-26 02:35:11,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:11,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175096473] [2019-11-26 02:35:11,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:11,301 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:35:11,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175096473] [2019-11-26 02:35:11,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:11,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:35:11,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214375635] [2019-11-26 02:35:11,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:35:11,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:35:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:35:11,323 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-11-26 02:35:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:11,341 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2019-11-26 02:35:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:35:11,342 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-11-26 02:35:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:11,350 INFO L225 Difference]: With dead ends: 44 [2019-11-26 02:35:11,351 INFO L226 Difference]: Without dead ends: 21 [2019-11-26 02:35:11,354 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:35:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-26 02:35:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-26 02:35:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-26 02:35:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-26 02:35:11,385 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 7 [2019-11-26 02:35:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:11,386 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-26 02:35:11,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:35:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-26 02:35:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:35:11,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:11,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:35:11,387 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 582490483, now seen corresponding path program 1 times [2019-11-26 02:35:11,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:11,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376440866] [2019-11-26 02:35:11,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:11,583 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:35:11,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376440866] [2019-11-26 02:35:11,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:35:11,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:35:11,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797318461] [2019-11-26 02:35:11,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:35:11,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:11,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:35:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:35:11,586 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-26 02:35:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:11,669 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-26 02:35:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:35:11,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:35:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:11,670 INFO L225 Difference]: With dead ends: 57 [2019-11-26 02:35:11,671 INFO L226 Difference]: Without dead ends: 31 [2019-11-26 02:35:11,672 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:35:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-26 02:35:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-11-26 02:35:11,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-26 02:35:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-26 02:35:11,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2019-11-26 02:35:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:11,677 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-26 02:35:11,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:35:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-26 02:35:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:35:11,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:11,678 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:35:11,679 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash -521453735, now seen corresponding path program 1 times [2019-11-26 02:35:11,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:11,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444400382] [2019-11-26 02:35:11,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:11,855 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:35:11,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444400382] [2019-11-26 02:35:11,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522144858] [2019-11-26 02:35:11,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/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:35:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:35:12,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 02:35:12,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:35:12,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,467 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-11-26 02:35:12,753 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-11-26 02:35:12,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:12,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,636 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 12 [2019-11-26 02:35:13,638 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:35:13,639 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:35:13,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:35:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:35:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:35:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:35:14,080 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:35:14,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1147204592] [2019-11-26 02:35:14,114 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2019-11-26 02:35:14,120 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:35:14,125 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:35:14,130 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:35:14,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:35:23,253 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 476 [2019-11-26 02:35:24,760 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-26 02:35:24,923 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 484 [2019-11-26 02:35:25,486 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 604 [2019-11-26 02:35:26,957 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 766 DAG size of output: 762 [2019-11-26 02:35:28,918 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:35:30,608 WARN L192 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 373 DAG size of output: 190 [2019-11-26 02:35:34,677 WARN L192 SmtUtils]: Spent 3.87 s on a formula simplification. DAG size of input: 484 DAG size of output: 429 [2019-11-26 02:35:35,683 WARN L192 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 150 [2019-11-26 02:35:36,569 WARN L192 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 148 [2019-11-26 02:35:39,204 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 361 DAG size of output: 257 [2019-11-26 02:35:39,294 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:35:39,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:35:39,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 6] total 12 [2019-11-26 02:35:39,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257486586] [2019-11-26 02:35:39,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 02:35:39,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:35:39,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 02:35:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:35:39,297 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 13 states. [2019-11-26 02:35:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:35:39,521 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-11-26 02:35:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:35:39,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-11-26 02:35:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:35:39,523 INFO L225 Difference]: With dead ends: 61 [2019-11-26 02:35:39,523 INFO L226 Difference]: Without dead ends: 42 [2019-11-26 02:35:39,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:35:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-26 02:35:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2019-11-26 02:35:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-26 02:35:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-11-26 02:35:39,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2019-11-26 02:35:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:35:39,534 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-11-26 02:35:39,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 02:35:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-11-26 02:35:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:35:39,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:35:39,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2019-11-26 02:35:39,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:35:39,741 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:35:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:35:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1559066701, now seen corresponding path program 2 times [2019-11-26 02:35:39,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:35:39,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165723027] [2019-11-26 02:35:39,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:35:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:35:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:35:40,093 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:35:40,097 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:35:40,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:35:40 BoogieIcfgContainer [2019-11-26 02:35:40,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:35:40,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:35:40,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:35:40,193 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:35:40,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:35:10" (3/4) ... [2019-11-26 02:35:40,195 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:35:40,296 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a69f5ca-1a25-4c47-b9e0-c8889ff4ad12/bin/utaipan/witness.graphml [2019-11-26 02:35:40,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:35:40,298 INFO L168 Benchmark]: Toolchain (without parser) took 31874.55 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 547.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 383.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:40,298 INFO L168 Benchmark]: CDTParser took 0.21 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:35:40,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:40,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.98 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:35:40,299 INFO L168 Benchmark]: Boogie Preprocessor took 59.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:35:40,300 INFO L168 Benchmark]: RCFGBuilder took 1797.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.1 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:40,300 INFO L168 Benchmark]: TraceAbstraction took 29201.10 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 404.8 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:40,300 INFO L168 Benchmark]: Witness Printer took 104.23 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:35:40,303 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.21 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 629.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.98 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 59.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1797.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 952.1 MB in the end (delta: 168.4 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29201.10 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 404.8 MB). Free memory was 952.1 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 231.3 MB. Max. memory is 11.5 GB. * Witness Printer took 104.23 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 752]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L757] int cleanupTimeShifts = 4; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L830] int retValue_acc ; [L831] int tmp ; [L464] int retValue_acc ; [L467] retValue_acc = 1 [L468] return (retValue_acc); [L837] tmp = valid_product() [L839] COND TRUE \read(tmp) [L480] int splverifierCounter ; [L481] int tmp ; [L482] int tmp___0 ; [L483] int tmp___1 ; [L484] int tmp___2 ; [L487] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L491] COND TRUE splverifierCounter < 4 [L497] tmp = __VERIFIER_nondet_int() [L499] COND TRUE \read(tmp) [L871] COND TRUE waterLevel < 2 [L872] waterLevel = waterLevel + 1 [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___2)) [L525] tmp___1 = __VERIFIER_nondet_int() [L527] COND FALSE !(\read(tmp___1)) [L562] COND FALSE !(\read(pumpRunning)) [L569] COND TRUE \read(systemActive) [L591] int tmp ; [L594] COND TRUE ! pumpRunning [L706] int retValue_acc ; [L707] int tmp ; [L708] int tmp___0 ; [L933] int retValue_acc ; [L936] COND FALSE !(waterLevel < 2) [L940] retValue_acc = 0 [L941] return (retValue_acc); [L712] tmp = isHighWaterSensorDry() [L714] COND FALSE !(\read(tmp)) [L717] tmp___0 = 1 [L719] retValue_acc = tmp___0 [L720] return (retValue_acc); [L596] tmp = isHighWaterLevel() [L598] COND TRUE \read(tmp) [L625] int tmp ; [L650] int retValue_acc ; [L892] int retValue_acc ; [L895] retValue_acc = methaneLevelCritical [L896] return (retValue_acc); [L654] retValue_acc = isMethaneLevelCritical() [L656] return (retValue_acc); [L629] tmp = isMethaneAlarm() [L631] COND FALSE !(\read(tmp)) [L619] pumpRunning = 1 [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L491] COND TRUE splverifierCounter < 4 [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___2)) [L525] tmp___1 = __VERIFIER_nondet_int() [L527] COND FALSE !(\read(tmp___1)) [L562] COND TRUE \read(pumpRunning) [L859] COND TRUE waterLevel > 0 [L860] waterLevel = waterLevel - 1 [L569] COND TRUE \read(systemActive) [L591] int tmp ; [L594] COND FALSE !(! pumpRunning) [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L491] COND TRUE splverifierCounter < 4 [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___2)) [L525] tmp___1 = __VERIFIER_nondet_int() [L527] COND FALSE !(\read(tmp___1)) [L562] COND TRUE \read(pumpRunning) [L859] COND TRUE waterLevel > 0 [L860] waterLevel = waterLevel - 1 [L569] COND TRUE \read(systemActive) [L591] int tmp ; [L594] COND FALSE !(! pumpRunning) [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L661] int retValue_acc ; [L664] retValue_acc = pumpRunning [L665] return (retValue_acc); [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L752] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 77 SDtfs, 70 SDslu, 160 SDs, 0 SdLazy, 114 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, 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, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 9810 SizeOfPredicates, 54 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 34 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 incorrect! Received shutdown request...