./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/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 5667765c016e1c72bafcc0c365d87d7652cb3eb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:47,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:47,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:47,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:47,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:47,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:47,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:47,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:47,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:47,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:47,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:47,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:47,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:47,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:47,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:47,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:47,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:47,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:47,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:47,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:47,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:47,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:47,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:47,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:47,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:47,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:47,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:47,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:47,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:47,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:47,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:47,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:47,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:47,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:47,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:47,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:47,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:47,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:47,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:47,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:47,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:47,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:47,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:47,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:47,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:47,835 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:47,836 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:47,836 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:47,836 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:47,836 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:47,836 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:47,837 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:47,837 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:47,837 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:47,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:47,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:47,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:47,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:47,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:47,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:47,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:47,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:47,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:47,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:47,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:47,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:47,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:47,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:47,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:47,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:47,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:47,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:47,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:47,842 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:47,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:47,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:47,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:47,843 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/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/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 -> 5667765c016e1c72bafcc0c365d87d7652cb3eb1 [2019-10-22 11:23:47,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:47,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:47,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:47,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:47,897 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:47,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c [2019-10-22 11:23:47,953 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/data/ca3bfb8ed/3ca9e8242a3a4d7693c3058d9775af6c/FLAGcd3964fbe [2019-10-22 11:23:48,433 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:48,433 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/sv-benchmarks/c/product-lines/minepump_spec3_product33.cil.c [2019-10-22 11:23:48,450 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/data/ca3bfb8ed/3ca9e8242a3a4d7693c3058d9775af6c/FLAGcd3964fbe [2019-10-22 11:23:48,750 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/data/ca3bfb8ed/3ca9e8242a3a4d7693c3058d9775af6c [2019-10-22 11:23:48,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:48,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:48,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:48,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:48,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:48,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:48" (1/1) ... [2019-10-22 11:23:48,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72689cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:48, skipping insertion in model container [2019-10-22 11:23:48,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:48" (1/1) ... [2019-10-22 11:23:48,769 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:48,814 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:49,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:49,158 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:49,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:49,305 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:49,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49 WrapperNode [2019-10-22 11:23:49,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:49,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:49,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:49,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:49,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:49,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:49,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:49,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:49,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... [2019-10-22 11:23:49,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:49,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:49,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:49,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:49,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/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-10-22 11:23:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:49,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:50,163 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:50,163 INFO L284 CfgBuilder]: Removed 102 assume(true) statements. [2019-10-22 11:23:50,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:50 BoogieIcfgContainer [2019-10-22 11:23:50,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:50,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:50,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:50,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:50,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:48" (1/3) ... [2019-10-22 11:23:50,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd92917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:50, skipping insertion in model container [2019-10-22 11:23:50,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:49" (2/3) ... [2019-10-22 11:23:50,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd92917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:50, skipping insertion in model container [2019-10-22 11:23:50,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:50" (3/3) ... [2019-10-22 11:23:50,172 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product33.cil.c [2019-10-22 11:23:50,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:50,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:23:50,206 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:23:50,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:50,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:50,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:50,242 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:50,242 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:50,242 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:50,242 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:50,242 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-10-22 11:23:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:23:50,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,263 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:50,265 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1284074395, now seen corresponding path program 1 times [2019-10-22 11:23:50,278 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165512695] [2019-10-22 11:23:50,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:50,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165512695] [2019-10-22 11:23:50,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:50,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:50,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656771850] [2019-10-22 11:23:50,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:50,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:50,490 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-10-22 11:23:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,515 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-10-22 11:23:50,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:50,517 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:23:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,529 INFO L225 Difference]: With dead ends: 162 [2019-10-22 11:23:50,529 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:23:50,533 INFO L600 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-10-22 11:23:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:23:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 11:23:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:23:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-10-22 11:23:50,568 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-10-22 11:23:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,569 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-10-22 11:23:50,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-10-22 11:23:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:23:50,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:50,570 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash 373043642, now seen corresponding path program 1 times [2019-10-22 11:23:50,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170072630] [2019-10-22 11:23:50,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:50,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170072630] [2019-10-22 11:23:50,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:50,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:50,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465344079] [2019-10-22 11:23:50,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:50,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,675 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-10-22 11:23:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,691 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-10-22 11:23:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:50,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:23:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,693 INFO L225 Difference]: With dead ends: 80 [2019-10-22 11:23:50,693 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:23:50,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:23:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:23:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:23:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-10-22 11:23:50,698 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-10-22 11:23:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,699 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-10-22 11:23:50,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-10-22 11:23:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:23:50,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,700 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:50,700 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash -196588044, now seen corresponding path program 1 times [2019-10-22 11:23:50,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103905641] [2019-10-22 11:23:50,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:50,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103905641] [2019-10-22 11:23:50,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:50,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:50,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22910776] [2019-10-22 11:23:50,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:50,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,772 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-10-22 11:23:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,779 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-10-22 11:23:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:50,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:23:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,780 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:23:50,780 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:23:50,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:23:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:23:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:23:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-10-22 11:23:50,786 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-10-22 11:23:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,786 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-10-22 11:23:50,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-10-22 11:23:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:23:50,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:50,787 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash 961211503, now seen corresponding path program 1 times [2019-10-22 11:23:50,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768900765] [2019-10-22 11:23:50,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:50,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768900765] [2019-10-22 11:23:50,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:50,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:50,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886731746] [2019-10-22 11:23:50,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:50,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:50,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,881 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-10-22 11:23:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:50,907 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-10-22 11:23:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:50,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:23:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:50,909 INFO L225 Difference]: With dead ends: 89 [2019-10-22 11:23:50,909 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 11:23:50,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 11:23:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-22 11:23:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:23:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-10-22 11:23:50,918 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-10-22 11:23:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:50,919 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-10-22 11:23:50,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-10-22 11:23:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:50,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:50,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:50,920 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1128412896, now seen corresponding path program 1 times [2019-10-22 11:23:50,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:50,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104753732] [2019-10-22 11:23:50,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:50,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:51,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104753732] [2019-10-22 11:23:51,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:51,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:51,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193520840] [2019-10-22 11:23:51,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:51,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:51,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:51,025 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-10-22 11:23:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:51,095 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-10-22 11:23:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:51,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:23:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:51,097 INFO L225 Difference]: With dead ends: 149 [2019-10-22 11:23:51,097 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 11:23:51,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 11:23:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-10-22 11:23:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 11:23:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-10-22 11:23:51,107 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-10-22 11:23:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:51,107 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-10-22 11:23:51,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-10-22 11:23:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:51,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:51,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:51,109 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1016803, now seen corresponding path program 1 times [2019-10-22 11:23:51,110 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:51,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890551529] [2019-10-22 11:23:51,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:51,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890551529] [2019-10-22 11:23:51,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:51,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:51,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294181955] [2019-10-22 11:23:51,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:51,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:51,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:51,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:51,217 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-10-22 11:23:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:51,374 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-10-22 11:23:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:51,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:23:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:51,377 INFO L225 Difference]: With dead ends: 314 [2019-10-22 11:23:51,377 INFO L226 Difference]: Without dead ends: 260 [2019-10-22 11:23:51,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-22 11:23:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-10-22 11:23:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-22 11:23:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-10-22 11:23:51,409 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-10-22 11:23:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:51,410 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-10-22 11:23:51,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-10-22 11:23:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:51,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:51,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:51,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2111743067, now seen corresponding path program 1 times [2019-10-22 11:23:51,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:51,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716509096] [2019-10-22 11:23:51,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:51,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716509096] [2019-10-22 11:23:51,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:51,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:51,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551215534] [2019-10-22 11:23:51,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:51,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:51,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:51,480 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-10-22 11:23:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:51,632 INFO L93 Difference]: Finished difference Result 446 states and 629 transitions. [2019-10-22 11:23:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:51,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:23:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:51,635 INFO L225 Difference]: With dead ends: 446 [2019-10-22 11:23:51,635 INFO L226 Difference]: Without dead ends: 392 [2019-10-22 11:23:51,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-22 11:23:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 152. [2019-10-22 11:23:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 11:23:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-10-22 11:23:51,675 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-10-22 11:23:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:51,680 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-10-22 11:23:51,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-10-22 11:23:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:51,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:51,681 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:51,682 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1172106979, now seen corresponding path program 1 times [2019-10-22 11:23:51,682 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:51,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199211306] [2019-10-22 11:23:51,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:51,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199211306] [2019-10-22 11:23:51,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:51,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:51,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440107258] [2019-10-22 11:23:51,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:51,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:51,753 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-10-22 11:23:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:51,802 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-10-22 11:23:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:51,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 11:23:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:51,804 INFO L225 Difference]: With dead ends: 352 [2019-10-22 11:23:51,804 INFO L226 Difference]: Without dead ends: 250 [2019-10-22 11:23:51,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-22 11:23:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-22 11:23:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-10-22 11:23:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-22 11:23:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-10-22 11:23:51,831 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-10-22 11:23:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:51,831 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-10-22 11:23:51,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-10-22 11:23:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:51,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:51,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:51,833 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1737298786, now seen corresponding path program 1 times [2019-10-22 11:23:51,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:51,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536870237] [2019-10-22 11:23:51,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:51,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:51,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536870237] [2019-10-22 11:23:51,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:51,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:51,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11546216] [2019-10-22 11:23:51,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:51,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:51,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:51,916 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 6 states. [2019-10-22 11:23:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:52,101 INFO L93 Difference]: Finished difference Result 383 states and 531 transitions. [2019-10-22 11:23:52,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:23:52,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-10-22 11:23:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:52,103 INFO L225 Difference]: With dead ends: 383 [2019-10-22 11:23:52,103 INFO L226 Difference]: Without dead ends: 120 [2019-10-22 11:23:52,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:23:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-22 11:23:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 60. [2019-10-22 11:23:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 11:23:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-10-22 11:23:52,118 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-10-22 11:23:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:52,118 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-10-22 11:23:52,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-10-22 11:23:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:52,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:52,125 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:52,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1430272417, now seen corresponding path program 1 times [2019-10-22 11:23:52,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:52,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517131299] [2019-10-22 11:23:52,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:52,126 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:52,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:52,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517131299] [2019-10-22 11:23:52,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:52,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:52,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698968063] [2019-10-22 11:23:52,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:52,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:52,198 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-10-22 11:23:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:52,235 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-10-22 11:23:52,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:52,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:23:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:52,236 INFO L225 Difference]: With dead ends: 103 [2019-10-22 11:23:52,236 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:23:52,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:23:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:23:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:23:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:23:52,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-22 11:23:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:52,238 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:23:52,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:23:52,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:23:52,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:23:53,005 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 13 [2019-10-22 11:23:53,259 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-10-22 11:23:53,387 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 20 [2019-10-22 11:23:53,534 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2019-10-22 11:23:53,691 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2019-10-22 11:23:53,806 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 19 [2019-10-22 11:23:54,014 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 13 [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L828(lines 828 832) no Hoare annotation was computed. [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L828-2(lines 828 832) no Hoare annotation was computed. [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L828-3(lines 828 832) no Hoare annotation was computed. [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L828-5(lines 828 832) no Hoare annotation was computed. [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L828-6(lines 828 832) no Hoare annotation was computed. [2019-10-22 11:23:54,023 INFO L443 ceAbstractionStarter]: For program point L828-8(lines 828 832) no Hoare annotation was computed. [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L779(lines 774 782) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (not (= |ULTIMATE.start_isPumpRunning_#res| 0)) (not (= ~pumpRunning~0 0)) (= 0 ULTIMATE.start_test_~splverifierCounter~0)) [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L779-1(lines 774 782) the Hoare annotation is: false [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L779-2(lines 774 782) the Hoare annotation is: false [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L135(lines 126 139) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) (and .cse0 .cse1 .cse2)) (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2))) [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L135-1(lines 126 139) the Hoare annotation is: false [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L135-2(lines 126 139) the Hoare annotation is: false [2019-10-22 11:23:54,024 INFO L439 ceAbstractionStarter]: At program point L895(lines 1 906) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 738) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L730-1(lines 730 738) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L730-2(lines 730 738) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L664-2(lines 694 700) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 57) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L53-3(lines 53 57) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L53-6(lines 53 57) no Hoare annotation was computed. [2019-10-22 11:23:54,025 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 204) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-10-22 11:23:54,025 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 654) no Hoare annotation was computed. [2019-10-22 11:23:54,026 INFO L439 ceAbstractionStarter]: At program point L648-1(lines 648 654) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-10-22 11:23:54,026 INFO L439 ceAbstractionStarter]: At program point L153-2(lines 153 167) the Hoare annotation is: false [2019-10-22 11:23:54,026 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-22 11:23:54,026 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 868) no Hoare annotation was computed. [2019-10-22 11:23:54,026 INFO L443 ceAbstractionStarter]: For program point L848-2(lines 848 868) no Hoare annotation was computed. [2019-10-22 11:23:54,026 INFO L443 ceAbstractionStarter]: For program point L848-4(lines 848 868) no Hoare annotation was computed. [2019-10-22 11:23:54,026 INFO L439 ceAbstractionStarter]: At program point L122(lines 117 125) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= |ULTIMATE.start_getWaterLevel_#res| 1) (<= ~waterLevel~0 1) .cse1 .cse2) (and .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (not .cse1) .cse2))) [2019-10-22 11:23:54,026 INFO L439 ceAbstractionStarter]: At program point L122-1(lines 117 125) the Hoare annotation is: false [2019-10-22 11:23:54,026 INFO L439 ceAbstractionStarter]: At program point L122-2(lines 117 125) the Hoare annotation is: false [2019-10-22 11:23:54,026 INFO L446 ceAbstractionStarter]: At program point L238(lines 219 241) the Hoare annotation is: true [2019-10-22 11:23:54,027 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-10-22 11:23:54,027 INFO L439 ceAbstractionStarter]: At program point L701(lines 701 707) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1) (not .cse2)) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= ~waterLevel~0 1) .cse2 .cse1))) [2019-10-22 11:23:54,029 INFO L439 ceAbstractionStarter]: At program point L701-1(lines 701 707) the Hoare annotation is: false [2019-10-22 11:23:54,029 INFO L439 ceAbstractionStarter]: At program point L701-2(lines 701 707) the Hoare annotation is: false [2019-10-22 11:23:54,030 INFO L439 ceAbstractionStarter]: At program point L90(lines 85 93) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (and .cse0 .cse1)) (not .cse2)) (and .cse0 (= 0 ULTIMATE.start_processEnvironment_~tmp~5) (<= ~waterLevel~0 1) .cse2 .cse1))) [2019-10-22 11:23:54,030 INFO L439 ceAbstractionStarter]: At program point L90-1(lines 85 93) the Hoare annotation is: false [2019-10-22 11:23:54,030 INFO L439 ceAbstractionStarter]: At program point L90-2(lines 85 93) the Hoare annotation is: false [2019-10-22 11:23:54,031 INFO L439 ceAbstractionStarter]: At program point L834(lines 819 837) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6)) (.cse1 (= 1 ~systemActive~0)) (.cse2 (<= ~waterLevel~0 1)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (= |ULTIMATE.start_isHighWaterSensorDry_#res| 0) .cse0 (and .cse1 .cse3 .cse4)) (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse2 .cse3 .cse4))) [2019-10-22 11:23:54,031 INFO L439 ceAbstractionStarter]: At program point L834-1(lines 819 837) the Hoare annotation is: false [2019-10-22 11:23:54,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:23:54,031 INFO L439 ceAbstractionStarter]: At program point L834-2(lines 819 837) the Hoare annotation is: false [2019-10-22 11:23:54,031 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 161) no Hoare annotation was computed. [2019-10-22 11:23:54,031 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 694 700) no Hoare annotation was computed. [2019-10-22 11:23:54,031 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-10-22 11:23:54,031 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-10-22 11:23:54,032 INFO L439 ceAbstractionStarter]: At program point L638-1(lines 638 644) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-10-22 11:23:54,032 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-10-22 11:23:54,032 INFO L439 ceAbstractionStarter]: At program point L903(lines 898 906) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-10-22 11:23:54,032 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:23:54,032 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 867) no Hoare annotation was computed. [2019-10-22 11:23:54,032 INFO L439 ceAbstractionStarter]: At program point L854-1(lines 1 906) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse2 (= 0 ULTIMATE.start_test_~splverifierCounter~0)) (.cse1 (= ~pumpRunning~0 0))) (or (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2) (and (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) (and .cse0 .cse2)) (not .cse1)))) [2019-10-22 11:23:54,032 INFO L443 ceAbstractionStarter]: For program point L854-2(lines 854 867) no Hoare annotation was computed. [2019-10-22 11:23:54,032 INFO L439 ceAbstractionStarter]: At program point L854-3(lines 1 906) the Hoare annotation is: false [2019-10-22 11:23:54,032 INFO L443 ceAbstractionStarter]: For program point L854-4(lines 854 867) no Hoare annotation was computed. [2019-10-22 11:23:54,033 INFO L439 ceAbstractionStarter]: At program point L854-5(lines 1 906) the Hoare annotation is: false [2019-10-22 11:23:54,034 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-10-22 11:23:54,034 INFO L439 ceAbstractionStarter]: At program point L674(lines 627 675) the Hoare annotation is: false [2019-10-22 11:23:54,034 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 669) no Hoare annotation was computed. [2019-10-22 11:23:54,034 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2019-10-22 11:23:54,034 INFO L446 ceAbstractionStarter]: At program point L229-1(lines 229 236) the Hoare annotation is: true [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 136) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 130 136) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L130-2(lines 130 136) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 69) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L858(lines 858 864) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L858-2(lines 858 864) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L726(lines 726 743) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L858-4(lines 858 864) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L726-1(lines 726 743) no Hoare annotation was computed. [2019-10-22 11:23:54,035 INFO L443 ceAbstractionStarter]: For program point L726-2(lines 726 743) no Hoare annotation was computed. [2019-10-22 11:23:54,036 INFO L439 ceAbstractionStarter]: At program point L694(lines 693 712) the Hoare annotation is: (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= 0 ULTIMATE.start_test_~splverifierCounter~0))) (or (and .cse0 (= ~pumpRunning~0 0) .cse1) (and (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~6) .cse0 .cse1))) [2019-10-22 11:23:54,036 INFO L443 ceAbstractionStarter]: For program point L694-1(lines 694 700) no Hoare annotation was computed. [2019-10-22 11:23:54,036 INFO L439 ceAbstractionStarter]: At program point L694-2(lines 693 712) the Hoare annotation is: false [2019-10-22 11:23:54,036 INFO L439 ceAbstractionStarter]: At program point L694-3(lines 693 712) the Hoare annotation is: false [2019-10-22 11:23:54,036 INFO L443 ceAbstractionStarter]: For program point L629(lines 628 673) no Hoare annotation was computed. [2019-10-22 11:23:54,036 INFO L443 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2019-10-22 11:23:54,036 INFO L443 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2019-10-22 11:23:54,036 INFO L443 ceAbstractionStarter]: For program point L613-2(line 613) no Hoare annotation was computed. [2019-10-22 11:23:54,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:54 BoogieIcfgContainer [2019-10-22 11:23:54,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:54,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:54,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:54,071 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:54,071 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:50" (3/4) ... [2019-10-22 11:23:54,078 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:23:54,098 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-10-22 11:23:54,099 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-10-22 11:23:54,099 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-10-22 11:23:54,100 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:23:54,100 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:23:54,100 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:23:54,142 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-10-22 11:23:54,144 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == systemActive && 0 == tmp) && \result <= 1) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && !(pumpRunning == 0)) && 0 == splverifierCounter) [2019-10-22 11:23:54,145 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == tmp && 1 == systemActive) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 0 && 0 == tmp) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) [2019-10-22 11:23:54,146 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 == systemActive && 0 == tmp) && !(\result == 0)) && !(pumpRunning == 0)) && 0 == splverifierCounter [2019-10-22 11:23:54,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fada62f5-38c2-45b9-85be-ea0901a9164e/bin/utaipan/witness.graphml [2019-10-22 11:23:54,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:54,219 INFO L168 Benchmark]: Toolchain (without parser) took 5466.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:54,220 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:54,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 551.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:54,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.75 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:54,220 INFO L168 Benchmark]: Boogie Preprocessor took 56.34 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-10-22 11:23:54,221 INFO L168 Benchmark]: RCFGBuilder took 744.20 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:54,221 INFO L168 Benchmark]: TraceAbstraction took 3904.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.2 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:54,221 INFO L168 Benchmark]: Witness Printer took 147.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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:54,223 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 551.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.75 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: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.34 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 744.20 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3904.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.2 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. * Witness Printer took 147.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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: 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: 117]: Loop Invariant Derived loop invariant: (((((1 == systemActive && 0 == tmp) && \result <= 1) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && 0 == tmp) && !(pumpRunning == 0)) && 0 == splverifierCounter) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (\result == 0 && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 898]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((0 == tmp && 1 == systemActive && 0 == splverifierCounter) && !(pumpRunning == 0)) || ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((((0 == tmp && 1 == systemActive) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((((\result == 0 && 0 == tmp) && (1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 1 == systemActive) && 0 == tmp___0) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((1 == systemActive && 0 == tmp) && !(\result == 0)) && !(pumpRunning == 0)) && 0 == splverifierCounter - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == systemActive && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive && 0 == splverifierCounter) && !(pumpRunning == 0)) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: (((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) && !(pumpRunning == 0)) || ((((1 == systemActive && 0 == tmp) && waterLevel <= 1) && pumpRunning == 0) && 0 == splverifierCounter) - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: ((1 == systemActive && pumpRunning == 0) && 0 == splverifierCounter) || ((0 == tmp && 1 == systemActive) && 0 == splverifierCounter) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 751 SDtfs, 863 SDslu, 1100 SDs, 0 SdLazy, 178 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 595 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 94 NumberOfFragments, 348 HoareAnnotationTreeSize, 33 FomulaSimplifications, 23600 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 33 FomulaSimplificationsInter, 5002 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 13265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...