./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product37.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_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product37.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/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 a4cdc62a5b5efdfba89a3280823bf73bd08d347a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:50,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:50,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:50,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:50,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:50,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:50,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:50,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:50,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:50,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:50,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:50,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:50,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:50,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:50,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:50,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:50,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:50,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:50,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:50,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:50,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:50,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:50,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:50,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:50,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:50,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:50,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:50,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:50,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:50,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:50,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:50,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:50,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:50,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:50,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:50,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:50,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:50,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:50,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:50,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:50,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:50,391 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:50,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:50,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:50,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:50,405 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:50,406 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:50,406 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:50,406 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:50,406 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:50,407 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:50,407 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:50,407 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:50,407 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:50,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:50,408 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:50,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:50,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:50,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:50,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:50,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:50,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:50,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:50,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:50,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:50,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:50,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:50,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:50,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:50,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:50,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:50,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:50,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:50,412 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:50,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:50,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:50,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:50,413 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_1d338430-da7a-4659-b1ef-2f06d92a9fbf/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 -> a4cdc62a5b5efdfba89a3280823bf73bd08d347a [2019-10-22 11:23:50,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:50,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:50,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:50,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:50,462 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:50,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec1_product37.cil.c [2019-10-22 11:23:50,516 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/data/2cb7de61b/58b15244ab484b748592f562d4f64414/FLAGc9cc9c818 [2019-10-22 11:23:50,979 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:50,980 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/sv-benchmarks/c/product-lines/minepump_spec1_product37.cil.c [2019-10-22 11:23:50,992 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/data/2cb7de61b/58b15244ab484b748592f562d4f64414/FLAGc9cc9c818 [2019-10-22 11:23:51,488 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/data/2cb7de61b/58b15244ab484b748592f562d4f64414 [2019-10-22 11:23:51,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:51,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:51,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:51,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:51,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:51,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ca5aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51, skipping insertion in model container [2019-10-22 11:23:51,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,515 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:51,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:51,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:51,957 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:52,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:52,078 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:52,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:52 WrapperNode [2019-10-22 11:23:52,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:52,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:52,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:52,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:52,089 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:52" (1/1) ... [2019-10-22 11:23:52,105 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:52" (1/1) ... [2019-10-22 11:23:52,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:52,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:52,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:52,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:52,175 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:52" (1/1) ... [2019-10-22 11:23:52,175 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:52" (1/1) ... [2019-10-22 11:23:52,191 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:52" (1/1) ... [2019-10-22 11:23:52,192 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:52" (1/1) ... [2019-10-22 11:23:52,203 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:52" (1/1) ... [2019-10-22 11:23:52,236 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:52" (1/1) ... [2019-10-22 11:23:52,239 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:52" (1/1) ... [2019-10-22 11:23:52,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:52,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:52,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:52,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:52,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/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:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:53,235 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:53,235 INFO L284 CfgBuilder]: Removed 156 assume(true) statements. [2019-10-22 11:23:53,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:53 BoogieIcfgContainer [2019-10-22 11:23:53,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:53,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:53,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:53,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:53,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:51" (1/3) ... [2019-10-22 11:23:53,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66284883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:53, skipping insertion in model container [2019-10-22 11:23:53,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:52" (2/3) ... [2019-10-22 11:23:53,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66284883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:53, skipping insertion in model container [2019-10-22 11:23:53,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:53" (3/3) ... [2019-10-22 11:23:53,246 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product37.cil.c [2019-10-22 11:23:53,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:53,263 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:23:53,270 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:23:53,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:53,299 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:53,299 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:53,299 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:53,299 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:53,299 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:53,299 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:53,300 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-10-22 11:23:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:23:53,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:53,323 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:23:53,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:53,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2109695399, now seen corresponding path program 1 times [2019-10-22 11:23:53,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:53,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669868347] [2019-10-22 11:23:53,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:53,525 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:53,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669868347] [2019-10-22 11:23:53,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:53,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:53,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922719089] [2019-10-22 11:23:53,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:53,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:53,543 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-10-22 11:23:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:53,574 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-10-22 11:23:53,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:53,576 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:23:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:53,585 INFO L225 Difference]: With dead ends: 216 [2019-10-22 11:23:53,585 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 11:23:53,588 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:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 11:23:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-22 11:23:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-22 11:23:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-10-22 11:23:53,640 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-10-22 11:23:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:53,641 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-10-22 11:23:53,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-10-22 11:23:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:23:53,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:53,642 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:23:53,642 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1093063509, now seen corresponding path program 1 times [2019-10-22 11:23:53,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:53,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749797294] [2019-10-22 11:23:53,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:53,795 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:53,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749797294] [2019-10-22 11:23:53,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:53,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:53,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182051728] [2019-10-22 11:23:53,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:53,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:53,798 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-10-22 11:23:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:53,818 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-10-22 11:23:53,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:53,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:23:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:53,819 INFO L225 Difference]: With dead ends: 107 [2019-10-22 11:23:53,819 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:23:53,820 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:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:23:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:23:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:23:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-10-22 11:23:53,826 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-10-22 11:23:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:53,826 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-10-22 11:23:53,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-10-22 11:23:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:23:53,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:53,827 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:23:53,828 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash -720159228, now seen corresponding path program 1 times [2019-10-22 11:23:53,828 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:53,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486261642] [2019-10-22 11:23:53,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:53,933 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:53,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486261642] [2019-10-22 11:23:53,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:53,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:53,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243483508] [2019-10-22 11:23:53,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:53,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:53,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:53,939 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. [2019-10-22 11:23:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:53,955 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-10-22 11:23:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:53,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 11:23:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:53,957 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:23:53,958 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:23:53,958 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:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:23:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 11:23:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:23:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-10-22 11:23:53,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-10-22 11:23:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:53,968 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-10-22 11:23:53,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-10-22 11:23:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:23:53,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:53,969 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:53,969 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:53,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:53,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2091202829, now seen corresponding path program 1 times [2019-10-22 11:23:53,970 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:53,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836976082] [2019-10-22 11:23:53,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:53,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,043 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:54,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836976082] [2019-10-22 11:23:54,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:54,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:54,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47238209] [2019-10-22 11:23:54,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:54,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:54,045 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-10-22 11:23:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:54,078 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-10-22 11:23:54,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:54,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:23:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:54,079 INFO L225 Difference]: With dead ends: 105 [2019-10-22 11:23:54,079 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 11:23:54,080 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:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 11:23:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-22 11:23:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-22 11:23:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-10-22 11:23:54,089 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-10-22 11:23:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:54,089 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-10-22 11:23:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-10-22 11:23:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:23:54,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:54,090 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] [2019-10-22 11:23:54,090 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1013899842, now seen corresponding path program 1 times [2019-10-22 11:23:54,095 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:54,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040730580] [2019-10-22 11:23:54,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,187 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:54,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040730580] [2019-10-22 11:23:54,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:54,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:54,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446028359] [2019-10-22 11:23:54,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:54,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:54,189 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-10-22 11:23:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:54,284 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-10-22 11:23:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:54,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:23:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:54,285 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:23:54,285 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 11:23:54,286 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:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 11:23:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-10-22 11:23:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:23:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-10-22 11:23:54,293 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-10-22 11:23:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:54,293 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-10-22 11:23:54,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-10-22 11:23:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 11:23:54,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:54,295 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] [2019-10-22 11:23:54,295 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1648611201, now seen corresponding path program 1 times [2019-10-22 11:23:54,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:54,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234545971] [2019-10-22 11:23:54,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,378 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:54,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234545971] [2019-10-22 11:23:54,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:54,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:54,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382641944] [2019-10-22 11:23:54,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:54,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:54,380 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-10-22 11:23:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:54,488 INFO L93 Difference]: Finished difference Result 344 states and 483 transitions. [2019-10-22 11:23:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:23:54,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-10-22 11:23:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:54,491 INFO L225 Difference]: With dead ends: 344 [2019-10-22 11:23:54,491 INFO L226 Difference]: Without dead ends: 280 [2019-10-22 11:23:54,492 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:23:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-22 11:23:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 128. [2019-10-22 11:23:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 11:23:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2019-10-22 11:23:54,525 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 30 [2019-10-22 11:23:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:54,525 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2019-10-22 11:23:54,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2019-10-22 11:23:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:54,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:54,526 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:54,526 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1974587593, now seen corresponding path program 1 times [2019-10-22 11:23:54,529 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:54,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582371477] [2019-10-22 11:23:54,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,530 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,604 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:54,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582371477] [2019-10-22 11:23:54,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:54,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:54,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970556957] [2019-10-22 11:23:54,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:54,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:54,607 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand 5 states. [2019-10-22 11:23:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:54,872 INFO L93 Difference]: Finished difference Result 366 states and 502 transitions. [2019-10-22 11:23:54,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:23:54,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:23:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:54,874 INFO L225 Difference]: With dead ends: 366 [2019-10-22 11:23:54,874 INFO L226 Difference]: Without dead ends: 364 [2019-10-22 11:23:54,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-22 11:23:54,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 128. [2019-10-22 11:23:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 11:23:54,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2019-10-22 11:23:54,890 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 31 [2019-10-22 11:23:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:54,891 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2019-10-22 11:23:54,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2019-10-22 11:23:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:54,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:54,892 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:54,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:54,893 INFO L82 PathProgramCache]: Analyzing trace with hash -735158350, now seen corresponding path program 1 times [2019-10-22 11:23:54,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:54,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834501865] [2019-10-22 11:23:54,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:54,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,935 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:54,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834501865] [2019-10-22 11:23:54,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:54,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:54,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038312652] [2019-10-22 11:23:54,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:54,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:54,937 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand 4 states. [2019-10-22 11:23:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:54,983 INFO L93 Difference]: Finished difference Result 308 states and 416 transitions. [2019-10-22 11:23:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:54,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:23:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:54,984 INFO L225 Difference]: With dead ends: 308 [2019-10-22 11:23:54,984 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:23:54,985 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:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:23:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2019-10-22 11:23:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-22 11:23:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2019-10-22 11:23:54,997 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 31 [2019-10-22 11:23:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:54,998 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2019-10-22 11:23:54,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2019-10-22 11:23:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:54,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:54,999 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:54,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash -476992912, now seen corresponding path program 1 times [2019-10-22 11:23:55,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:55,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817695967] [2019-10-22 11:23:55,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:55,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:55,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:55,061 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:55,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817695967] [2019-10-22 11:23:55,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:55,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:55,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549544731] [2019-10-22 11:23:55,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:55,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:55,063 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand 3 states. [2019-10-22 11:23:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:55,096 INFO L93 Difference]: Finished difference Result 316 states and 422 transitions. [2019-10-22 11:23:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:55,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:23:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:55,098 INFO L225 Difference]: With dead ends: 316 [2019-10-22 11:23:55,098 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:23:55,098 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:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:23:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-10-22 11:23:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 11:23:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2019-10-22 11:23:55,121 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 31 [2019-10-22 11:23:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:55,123 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2019-10-22 11:23:55,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2019-10-22 11:23:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:55,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:55,124 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:55,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1705214514, now seen corresponding path program 1 times [2019-10-22 11:23:55,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:55,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231853649] [2019-10-22 11:23:55,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:55,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:55,728 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:23:55,728 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:55,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:55 BoogieIcfgContainer [2019-10-22 11:23:55,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:55,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:55,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:55,836 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:55,837 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:53" (3/4) ... [2019-10-22 11:23:55,839 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:23:55,928 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1d338430-da7a-4659-b1ef-2f06d92a9fbf/bin/utaipan/witness.graphml [2019-10-22 11:23:55,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:55,930 INFO L168 Benchmark]: Toolchain (without parser) took 4437.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 943.2 MB in the beginning and 933.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 144.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:55,931 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:55,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:55,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.76 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:55,933 INFO L168 Benchmark]: Boogie Preprocessor took 90.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:55,933 INFO L168 Benchmark]: RCFGBuilder took 985.37 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:55,933 INFO L168 Benchmark]: TraceAbstraction took 2598.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 951.0 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:55,934 INFO L168 Benchmark]: Witness Printer took 92.03 ms. Allocated memory is still 1.2 GB. Free memory was 951.0 MB in the beginning and 933.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:55,935 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 583.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -179.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 985.37 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: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2598.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 951.0 MB in the end (delta: 96.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * Witness Printer took 92.03 ms. Allocated memory is still 1.2 GB. Free memory was 951.0 MB in the beginning and 933.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L832] int waterLevel = 1; [L833] int methaneLevelCritical = 0; [L487] int retValue_acc ; [L488] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L574] int retValue_acc ; [L577] retValue_acc = 1 [L578] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L494] tmp = valid_product() [L496] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L767] int splverifierCounter ; [L768] int tmp ; [L769] int tmp___0 ; [L770] int tmp___1 ; [L771] int tmp___2 ; [L774] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L778] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L784] tmp = __VERIFIER_nondet_int() [L786] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L850] COND TRUE waterLevel < 2 [L851] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L794] tmp___0 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L862] COND FALSE !(\read(methaneLevelCritical)) [L865] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L804] tmp___2 = __VERIFIER_nondet_int() [L806] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L595] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L602] COND TRUE \read(systemActive) [L650] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L653] COND FALSE !(\read(pumpRunning)) [L624] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L627] COND TRUE ! pumpRunning [L747] int retValue_acc ; [L748] int tmp ; [L749] int tmp___0 ; [L912] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L915] COND FALSE !(waterLevel < 2) [L919] retValue_acc = 0 [L920] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L753] tmp = isHighWaterSensorDry() [L755] COND FALSE !(\read(tmp)) [L758] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L760] retValue_acc = tmp___0 [L761] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] tmp = isHighWaterLevel() [L631] COND TRUE \read(tmp) [L678] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L514] int tmp ; [L515] int tmp___0 ; [L871] int retValue_acc ; [L874] retValue_acc = methaneLevelCritical [L875] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L519] tmp = isMethaneLevelCritical() [L521] COND TRUE \read(tmp) [L702] int retValue_acc ; [L705] retValue_acc = pumpRunning [L706] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L523] tmp___0 = isPumpRunning() [L525] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L543] __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, 111 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 787 SDtfs, 819 SDslu, 960 SDs, 0 SdLazy, 146 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred 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, 483 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 11991 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...