./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product55.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_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/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 f98010979adc33ea49508c52e1057d4173359b78 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:51,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:51,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:51,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:51,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:51,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:51,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:51,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:51,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:51,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:51,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:51,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:51,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:51,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:51,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:51,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:51,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:51,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:51,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:51,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:51,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:51,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:51,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:51,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:51,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:51,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:51,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:51,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:51,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:51,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:51,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:51,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:51,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:51,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:51,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:51,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:51,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:51,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:51,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:51,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:51,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:51,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:51,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:51,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:51,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:51,933 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:51,934 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:51,934 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:51,934 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:51,934 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:51,934 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:51,934 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:51,934 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:51,935 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:51,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:51,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:51,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:51,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:51,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:51,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:51,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:51,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:51,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:51,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:51,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:51,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:51,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:51,938 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:51,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:51,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:51,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:51,939 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_e0c5e76f-3929-4d02-9d25-878e4685a41f/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 -> f98010979adc33ea49508c52e1057d4173359b78 [2019-10-22 11:21:51,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:51,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:51,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:51,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:51,977 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:51,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2019-10-22 11:21:52,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/data/713765484/2febb2f85dbb41c499fcc3c5de0a22f5/FLAGe4b8ad315 [2019-10-22 11:21:52,482 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:52,483 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2019-10-22 11:21:52,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/data/713765484/2febb2f85dbb41c499fcc3c5de0a22f5/FLAGe4b8ad315 [2019-10-22 11:21:52,823 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/data/713765484/2febb2f85dbb41c499fcc3c5de0a22f5 [2019-10-22 11:21:52,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:52,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:52,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:52,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:52,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:52,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4212018f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:52, skipping insertion in model container [2019-10-22 11:21:52,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:52" (1/1) ... [2019-10-22 11:21:52,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:52,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:53,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:53,291 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:53,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:53,430 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:53,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53 WrapperNode [2019-10-22 11:21:53,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:53,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:53,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:53,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:53,440 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:21:53" (1/1) ... [2019-10-22 11:21:53,456 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:21:53" (1/1) ... [2019-10-22 11:21:53,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:53,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:53,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:53,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:53,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,545 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:53,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:53,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:53,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:53,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/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:21:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:21:53,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:53,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:54,427 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:54,427 INFO L284 CfgBuilder]: Removed 280 assume(true) statements. [2019-10-22 11:21:54,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:54 BoogieIcfgContainer [2019-10-22 11:21:54,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:54,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:54,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:54,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:54,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:52" (1/3) ... [2019-10-22 11:21:54,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c5a418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:54, skipping insertion in model container [2019-10-22 11:21:54,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (2/3) ... [2019-10-22 11:21:54,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c5a418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:54, skipping insertion in model container [2019-10-22 11:21:54,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:54" (3/3) ... [2019-10-22 11:21:54,436 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product55.cil.c [2019-10-22 11:21:54,446 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:54,454 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:21:54,462 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:21:54,484 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:54,484 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:54,484 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:54,484 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:54,485 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:54,485 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:54,485 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:54,485 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-10-22 11:21:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:21:54,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,507 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,509 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1084846627, now seen corresponding path program 1 times [2019-10-22 11:21:54,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396826656] [2019-10-22 11:21:54,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,693 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:21:54,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396826656] [2019-10-22 11:21:54,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:54,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601163768] [2019-10-22 11:21:54,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:21:54,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:21:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:21:54,725 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-10-22 11:21:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,765 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-10-22 11:21:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:21:54,767 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:21:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:54,781 INFO L225 Difference]: With dead ends: 376 [2019-10-22 11:21:54,781 INFO L226 Difference]: Without dead ends: 187 [2019-10-22 11:21:54,785 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:21:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-22 11:21:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-10-22 11:21:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 11:21:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-10-22 11:21:54,827 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-10-22 11:21:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:54,827 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-10-22 11:21:54,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:21:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-10-22 11:21:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:54,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,829 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,829 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash 38089730, now seen corresponding path program 1 times [2019-10-22 11:21:54,829 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:54,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180613195] [2019-10-22 11:21:54,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,830 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:54,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,981 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:21:54,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180613195] [2019-10-22 11:21:54,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:54,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844882652] [2019-10-22 11:21:54,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:54,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:54,984 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-10-22 11:21:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:54,998 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2019-10-22 11:21:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:54,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:21:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,000 INFO L225 Difference]: With dead ends: 187 [2019-10-22 11:21:55,000 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:21:55,001 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:21:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:21:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-10-22 11:21:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-22 11:21:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-10-22 11:21:55,007 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-10-22 11:21:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,008 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-10-22 11:21:55,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-10-22 11:21:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:21:55,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,009 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] [2019-10-22 11:21:55,009 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1082167242, now seen corresponding path program 1 times [2019-10-22 11:21:55,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031926841] [2019-10-22 11:21:55,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,111 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:21:55,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031926841] [2019-10-22 11:21:55,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:55,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125284641] [2019-10-22 11:21:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:55,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:55,113 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 6 states. [2019-10-22 11:21:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,224 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2019-10-22 11:21:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:55,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-10-22 11:21:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,226 INFO L225 Difference]: With dead ends: 230 [2019-10-22 11:21:55,226 INFO L226 Difference]: Without dead ends: 163 [2019-10-22 11:21:55,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-22 11:21:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2019-10-22 11:21:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-22 11:21:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2019-10-22 11:21:55,239 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 22 [2019-10-22 11:21:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,239 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-10-22 11:21:55,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2019-10-22 11:21:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:55,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,241 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:21:55,241 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1933185311, now seen corresponding path program 1 times [2019-10-22 11:21:55,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682778682] [2019-10-22 11:21:55,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,292 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:21:55,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682778682] [2019-10-22 11:21:55,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:55,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115495065] [2019-10-22 11:21:55,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:55,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:55,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:55,294 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 3 states. [2019-10-22 11:21:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,343 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2019-10-22 11:21:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:55,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:21:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,345 INFO L225 Difference]: With dead ends: 187 [2019-10-22 11:21:55,345 INFO L226 Difference]: Without dead ends: 101 [2019-10-22 11:21:55,346 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:21:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-22 11:21:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-22 11:21:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 11:21:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2019-10-22 11:21:55,358 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 25 [2019-10-22 11:21:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,358 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2019-10-22 11:21:55,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:55,359 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2019-10-22 11:21:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:55,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,363 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:21:55,364 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash 2034893835, now seen corresponding path program 1 times [2019-10-22 11:21:55,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899923424] [2019-10-22 11:21:55,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,473 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:21:55,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899923424] [2019-10-22 11:21:55,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:55,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754052607] [2019-10-22 11:21:55,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:55,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:55,476 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand 5 states. [2019-10-22 11:21:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,670 INFO L93 Difference]: Finished difference Result 281 states and 403 transitions. [2019-10-22 11:21:55,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:55,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:21:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,672 INFO L225 Difference]: With dead ends: 281 [2019-10-22 11:21:55,673 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 11:21:55,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 11:21:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 99. [2019-10-22 11:21:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-22 11:21:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2019-10-22 11:21:55,697 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 25 [2019-10-22 11:21:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,698 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2019-10-22 11:21:55,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2019-10-22 11:21:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:21:55,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,699 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:21:55,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash -899676752, now seen corresponding path program 1 times [2019-10-22 11:21:55,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475146022] [2019-10-22 11:21:55,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,775 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:21:55,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475146022] [2019-10-22 11:21:55,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:55,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564805212] [2019-10-22 11:21:55,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:55,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:55,777 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand 5 states. [2019-10-22 11:21:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,873 INFO L93 Difference]: Finished difference Result 282 states and 395 transitions. [2019-10-22 11:21:55,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:55,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:21:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,877 INFO L225 Difference]: With dead ends: 282 [2019-10-22 11:21:55,877 INFO L226 Difference]: Without dead ends: 189 [2019-10-22 11:21:55,878 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:21:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-22 11:21:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 108. [2019-10-22 11:21:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 11:21:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2019-10-22 11:21:55,901 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 31 [2019-10-22 11:21:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,901 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2019-10-22 11:21:55,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2019-10-22 11:21:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:21:55,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,908 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:21:55,908 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1292703762, now seen corresponding path program 1 times [2019-10-22 11:21:55,908 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:55,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21305174] [2019-10-22 11:21:55,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:55,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:55,991 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:21:55,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21305174] [2019-10-22 11:21:55,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:55,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:55,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116100827] [2019-10-22 11:21:55,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:55,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:55,993 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand 4 states. [2019-10-22 11:21:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,052 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2019-10-22 11:21:56,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:56,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:21:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,053 INFO L225 Difference]: With dead ends: 266 [2019-10-22 11:21:56,053 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 11:21:56,054 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:21:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 11:21:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 114. [2019-10-22 11:21:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:21:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2019-10-22 11:21:56,069 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 31 [2019-10-22 11:21:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,070 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2019-10-22 11:21:56,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2019-10-22 11:21:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:21:56,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,074 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:21:56,074 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1034538324, now seen corresponding path program 1 times [2019-10-22 11:21:56,075 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170709227] [2019-10-22 11:21:56,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,131 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:21:56,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170709227] [2019-10-22 11:21:56,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:56,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204796278] [2019-10-22 11:21:56,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:56,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,133 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand 3 states. [2019-10-22 11:21:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,163 INFO L93 Difference]: Finished difference Result 269 states and 365 transitions. [2019-10-22 11:21:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:56,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:21:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,165 INFO L225 Difference]: With dead ends: 269 [2019-10-22 11:21:56,165 INFO L226 Difference]: Without dead ends: 161 [2019-10-22 11:21:56,165 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:21:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-22 11:21:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-10-22 11:21:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-22 11:21:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2019-10-22 11:21:56,184 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 31 [2019-10-22 11:21:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,184 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2019-10-22 11:21:56,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2019-10-22 11:21:56,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:21:56,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,185 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:21:56,186 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1147669102, now seen corresponding path program 1 times [2019-10-22 11:21:56,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653446693] [2019-10-22 11:21:56,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,266 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:21:56,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653446693] [2019-10-22 11:21:56,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:56,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290750837] [2019-10-22 11:21:56,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:56,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:56,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:56,268 INFO L87 Difference]: Start difference. First operand 161 states and 214 transitions. Second operand 5 states. [2019-10-22 11:21:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,395 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2019-10-22 11:21:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:56,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:21:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,398 INFO L225 Difference]: With dead ends: 818 [2019-10-22 11:21:56,398 INFO L226 Difference]: Without dead ends: 663 [2019-10-22 11:21:56,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-22 11:21:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 304. [2019-10-22 11:21:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-22 11:21:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 400 transitions. [2019-10-22 11:21:56,428 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 400 transitions. Word has length 32 [2019-10-22 11:21:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,429 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 400 transitions. [2019-10-22 11:21:56,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 400 transitions. [2019-10-22 11:21:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:21:56,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,430 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, 1] [2019-10-22 11:21:56,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1539369524, now seen corresponding path program 1 times [2019-10-22 11:21:56,431 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057616392] [2019-10-22 11:21:56,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:56,941 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:56,942 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:57,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:57 BoogieIcfgContainer [2019-10-22 11:21:57,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:57,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:57,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:57,046 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:57,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:54" (3/4) ... [2019-10-22 11:21:57,049 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:57,126 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e0c5e76f-3929-4d02-9d25-878e4685a41f/bin/utaipan/witness.graphml [2019-10-22 11:21:57,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:57,128 INFO L168 Benchmark]: Toolchain (without parser) took 4300.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 938.3 MB in the beginning and 871.8 MB in the end (delta: 66.5 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,129 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:57,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.94 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.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,131 INFO L168 Benchmark]: Boogie Preprocessor took 43.37 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: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,133 INFO L168 Benchmark]: RCFGBuilder took 882.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,133 INFO L168 Benchmark]: TraceAbstraction took 2616.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 885.9 MB in the end (delta: 141.1 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,134 INFO L168 Benchmark]: Witness Printer took 80.63 ms. Allocated memory is still 1.2 GB. Free memory was 885.9 MB in the beginning and 871.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:57,135 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 603.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 936.9 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.94 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.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.37 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: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 882.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2616.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 885.9 MB in the end (delta: 141.1 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. * Witness Printer took 80.63 ms. Allocated memory is still 1.2 GB. Free memory was 885.9 MB in the beginning and 871.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 506]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L159] int pumpRunning = 0; [L160] int systemActive = 1; [L399] int waterLevel = 1; [L400] int methaneLevelCritical = 0; [L511] int cleanupTimeShifts = 4; [L802] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L584] int retValue_acc ; [L585] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L591] tmp = valid_product() [L593] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L84] int splverifierCounter ; [L85] int tmp ; [L86] int tmp___0 ; [L87] int tmp___1 ; [L88] int tmp___2 ; [L91] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L93] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L95] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L101] tmp = __VERIFIER_nondet_int() [L103] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] COND TRUE waterLevel < 2 [L418] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L111] tmp___0 = __VERIFIER_nondet_int() [L113] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L429] COND FALSE !(\read(methaneLevelCritical)) [L432] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L121] tmp___2 = __VERIFIER_nondet_int() [L123] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L167] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L174] COND TRUE \read(systemActive) [L248] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L251] COND FALSE !(\read(pumpRunning)) [L222] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L225] COND FALSE !(\read(pumpRunning)) [L196] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L199] COND TRUE ! pumpRunning [L345] int retValue_acc ; [L346] int tmp ; [L347] int tmp___0 ; [L479] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L482] COND FALSE !(waterLevel < 2) [L486] retValue_acc = 0 [L487] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L351] tmp = isHighWaterSensorDry() [L353] COND FALSE !(\read(tmp)) [L356] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L358] retValue_acc = tmp___0 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L201] tmp = isHighWaterLevel() [L203] COND TRUE \read(tmp) [L276] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L608] int tmp ; [L609] int tmp___0 ; [L438] int retValue_acc ; [L441] retValue_acc = methaneLevelCritical [L442] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L613] tmp = isMethaneLevelCritical() [L615] COND TRUE \read(tmp) [L300] int retValue_acc ; [L303] retValue_acc = pumpRunning [L304] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L617] tmp___0 = isPumpRunning() [L619] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L506] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 191 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1183 SDtfs, 1480 SDslu, 1720 SDs, 0 SdLazy, 217 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=9, 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, 9 MinimizatonAttempts, 743 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 15338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 incorrect! Received shutdown request...