./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/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 e09138f51265758a55ca4b42a17e715ba685a263 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:21:15,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:21:15,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:21:15,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:21:15,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:21:15,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:21:15,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:21:15,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:21:15,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:21:15,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:21:15,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:21:15,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:21:15,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:21:15,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:21:15,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:21:15,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:21:15,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:21:15,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:21:15,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:21:15,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:21:15,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:21:15,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:21:15,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:21:15,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:21:15,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:21:15,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:21:15,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:21:15,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:21:15,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:21:15,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:21:15,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:21:15,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:21:15,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:21:15,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:21:15,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:21:15,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:21:15,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:21:15,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:21:15,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:21:15,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:21:15,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:21:15,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:21:15,458 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:21:15,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:21:15,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:21:15,459 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:21:15,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:21:15,460 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:21:15,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:21:15,460 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:21:15,460 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:21:15,460 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:21:15,460 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:21:15,461 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:21:15,461 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:21:15,461 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:21:15,461 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:21:15,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:21:15,462 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:21:15,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:21:15,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:21:15,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:21:15,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:21:15,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:21:15,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:21:15,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:21:15,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:21:15,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:21:15,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:21:15,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:21:15,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:21:15,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:21:15,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:21:15,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:21:15,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:21:15,465 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:21:15,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:21:15,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:21:15,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:21:15,466 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/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 -> e09138f51265758a55ca4b42a17e715ba685a263 [2019-11-26 02:21:15,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:21:15,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:21:15,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:21:15,652 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:21:15,653 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:21:15,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2019-11-26 02:21:15,703 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/data/c8e1933f9/4e857b0892dc49c3b1dfa8dc2ea95a11/FLAGa47762222 [2019-11-26 02:21:16,225 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:21:16,225 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/sv-benchmarks/c/eca-rers2012/Problem01_label11.c [2019-11-26 02:21:16,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/data/c8e1933f9/4e857b0892dc49c3b1dfa8dc2ea95a11/FLAGa47762222 [2019-11-26 02:21:16,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/data/c8e1933f9/4e857b0892dc49c3b1dfa8dc2ea95a11 [2019-11-26 02:21:16,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:21:16,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:21:16,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:21:16,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:21:16,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:21:16,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:21:16" (1/1) ... [2019-11-26 02:21:16,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312eab7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:16, skipping insertion in model container [2019-11-26 02:21:16,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:21:16" (1/1) ... [2019-11-26 02:21:16,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:21:16,793 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:21:17,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:21:17,248 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:21:17,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:21:17,368 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:21:17,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17 WrapperNode [2019-11-26 02:21:17,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:21:17,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:21:17,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:21:17,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:21:17,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:21:17,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:21:17,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:21:17,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:21:17,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... [2019-11-26 02:21:17,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:21:17,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:21:17,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:21:17,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:21:17,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:21:17,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:21:17,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:21:19,559 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:21:19,560 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:21:19,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:21:19 BoogieIcfgContainer [2019-11-26 02:21:19,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:21:19,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:21:19,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:21:19,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:21:19,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:21:16" (1/3) ... [2019-11-26 02:21:19,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507c0c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:21:19, skipping insertion in model container [2019-11-26 02:21:19,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:21:17" (2/3) ... [2019-11-26 02:21:19,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507c0c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:21:19, skipping insertion in model container [2019-11-26 02:21:19,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:21:19" (3/3) ... [2019-11-26 02:21:19,572 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label11.c [2019-11-26 02:21:19,581 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:21:19,587 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:21:19,598 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:21:19,626 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:21:19,626 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:21:19,626 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:21:19,626 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:21:19,626 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:21:19,627 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:21:19,627 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:21:19,627 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:21:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:21:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:21:19,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:19,657 INFO L410 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, 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, 1, 1, 1, 1, 1] [2019-11-26 02:21:19,657 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1323234457, now seen corresponding path program 1 times [2019-11-26 02:21:19,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:19,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661796503] [2019-11-26 02:21:19,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:21:20,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661796503] [2019-11-26 02:21:20,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:20,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:20,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863304397] [2019-11-26 02:21:20,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:20,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:20,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:20,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:20,108 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:21:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:20,837 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:21:20,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:20,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:21:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:20,858 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:21:20,859 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:21:20,863 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:21:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:21:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:21:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:21:20,933 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:21:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:20,935 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:21:20,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:21:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:21:20,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:20,942 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 1, 1, 1] [2019-11-26 02:21:20,942 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1048387078, now seen corresponding path program 1 times [2019-11-26 02:21:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:20,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133549705] [2019-11-26 02:21:20,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:21:21,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133549705] [2019-11-26 02:21:21,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:21,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:21,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433776439] [2019-11-26 02:21:21,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:21,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:21,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:21,019 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:21:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:21,608 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:21:21,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:21,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:21:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:21,611 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:21:21,611 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:21:21,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:21:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:21:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:21:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 706 transitions. [2019-11-26 02:21:21,647 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 706 transitions. Word has length 77 [2019-11-26 02:21:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:21,647 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 706 transitions. [2019-11-26 02:21:21,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 706 transitions. [2019-11-26 02:21:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:21:21,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:21,651 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 1, 1] [2019-11-26 02:21:21,652 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:21,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2123291750, now seen corresponding path program 1 times [2019-11-26 02:21:21,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:21,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502187090] [2019-11-26 02:21:21,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:21:21,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502187090] [2019-11-26 02:21:21,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:21,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:21:21,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061040786] [2019-11-26 02:21:21,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:21,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:21,747 INFO L87 Difference]: Start difference. First operand 429 states and 706 transitions. Second operand 4 states. [2019-11-26 02:21:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:22,347 INFO L93 Difference]: Finished difference Result 1425 states and 2329 transitions. [2019-11-26 02:21:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:22,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-26 02:21:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:22,354 INFO L225 Difference]: With dead ends: 1425 [2019-11-26 02:21:22,354 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:21:22,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:21:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 642. [2019-11-26 02:21:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:21:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 954 transitions. [2019-11-26 02:21:22,388 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 954 transitions. Word has length 78 [2019-11-26 02:21:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:22,389 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 954 transitions. [2019-11-26 02:21:22,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 954 transitions. [2019-11-26 02:21:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-26 02:21:22,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:22,393 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-26 02:21:22,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:22,393 INFO L82 PathProgramCache]: Analyzing trace with hash -888988622, now seen corresponding path program 1 times [2019-11-26 02:21:22,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:22,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167914426] [2019-11-26 02:21:22,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:21:22,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167914426] [2019-11-26 02:21:22,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:22,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:21:22,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859034405] [2019-11-26 02:21:22,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:21:22,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:22,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:21:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:21:22,506 INFO L87 Difference]: Start difference. First operand 642 states and 954 transitions. Second operand 3 states. [2019-11-26 02:21:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:22,851 INFO L93 Difference]: Finished difference Result 1354 states and 2002 transitions. [2019-11-26 02:21:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:21:22,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-26 02:21:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:22,856 INFO L225 Difference]: With dead ends: 1354 [2019-11-26 02:21:22,856 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:21:22,859 INFO L630 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-11-26 02:21:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:21:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 500. [2019-11-26 02:21:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-26 02:21:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 698 transitions. [2019-11-26 02:21:22,883 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 698 transitions. Word has length 119 [2019-11-26 02:21:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:22,885 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 698 transitions. [2019-11-26 02:21:22,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:21:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 698 transitions. [2019-11-26 02:21:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-26 02:21:22,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:22,893 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-26 02:21:22,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1267308565, now seen corresponding path program 1 times [2019-11-26 02:21:22,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:22,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108328714] [2019-11-26 02:21:22,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-26 02:21:23,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108328714] [2019-11-26 02:21:23,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:23,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:21:23,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156320947] [2019-11-26 02:21:23,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:21:23,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:23,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:21:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:21:23,005 INFO L87 Difference]: Start difference. First operand 500 states and 698 transitions. Second operand 3 states. [2019-11-26 02:21:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:23,357 INFO L93 Difference]: Finished difference Result 1283 states and 1799 transitions. [2019-11-26 02:21:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:21:23,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-26 02:21:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:23,363 INFO L225 Difference]: With dead ends: 1283 [2019-11-26 02:21:23,363 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:21:23,364 INFO L630 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-11-26 02:21:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:21:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-26 02:21:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:21:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 798 transitions. [2019-11-26 02:21:23,385 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 798 transitions. Word has length 155 [2019-11-26 02:21:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:23,385 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 798 transitions. [2019-11-26 02:21:23,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:21:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 798 transitions. [2019-11-26 02:21:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-26 02:21:23,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:23,388 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-11-26 02:21:23,388 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1180344489, now seen corresponding path program 1 times [2019-11-26 02:21:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:23,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903634378] [2019-11-26 02:21:23,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-26 02:21:23,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903634378] [2019-11-26 02:21:23,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:23,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:23,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176723540] [2019-11-26 02:21:23,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:23,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:23,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:23,495 INFO L87 Difference]: Start difference. First operand 642 states and 798 transitions. Second operand 4 states. [2019-11-26 02:21:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:23,879 INFO L93 Difference]: Finished difference Result 1371 states and 1694 transitions. [2019-11-26 02:21:23,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:21:23,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-26 02:21:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:23,884 INFO L225 Difference]: With dead ends: 1371 [2019-11-26 02:21:23,884 INFO L226 Difference]: Without dead ends: 730 [2019-11-26 02:21:23,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:21:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-26 02:21:23,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 713. [2019-11-26 02:21:23,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:21:23,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 872 transitions. [2019-11-26 02:21:23,907 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 872 transitions. Word has length 163 [2019-11-26 02:21:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:23,910 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 872 transitions. [2019-11-26 02:21:23,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 872 transitions. [2019-11-26 02:21:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-26 02:21:23,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:23,914 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-26 02:21:23,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash 905274081, now seen corresponding path program 1 times [2019-11-26 02:21:23,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:23,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071436849] [2019-11-26 02:21:23,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-26 02:21:24,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071436849] [2019-11-26 02:21:24,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:24,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:21:24,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521432799] [2019-11-26 02:21:24,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:21:24,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:21:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:24,010 INFO L87 Difference]: Start difference. First operand 713 states and 872 transitions. Second operand 4 states. [2019-11-26 02:21:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:24,415 INFO L93 Difference]: Finished difference Result 1709 states and 2109 transitions. [2019-11-26 02:21:24,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:21:24,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-26 02:21:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:24,421 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:21:24,421 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:21:24,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:21:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:21:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 855. [2019-11-26 02:21:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:21:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1024 transitions. [2019-11-26 02:21:24,442 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1024 transitions. Word has length 167 [2019-11-26 02:21:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:24,442 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1024 transitions. [2019-11-26 02:21:24,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:21:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1024 transitions. [2019-11-26 02:21:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-26 02:21:24,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:24,446 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-26 02:21:24,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:24,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 681487844, now seen corresponding path program 1 times [2019-11-26 02:21:24,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:24,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082874885] [2019-11-26 02:21:24,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-26 02:21:24,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082874885] [2019-11-26 02:21:24,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:21:24,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:21:24,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608522841] [2019-11-26 02:21:24,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:21:24,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:21:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:21:24,632 INFO L87 Difference]: Start difference. First operand 855 states and 1024 transitions. Second operand 8 states. [2019-11-26 02:21:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:25,278 INFO L93 Difference]: Finished difference Result 1890 states and 2264 transitions. [2019-11-26 02:21:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:21:25,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-11-26 02:21:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:25,284 INFO L225 Difference]: With dead ends: 1890 [2019-11-26 02:21:25,284 INFO L226 Difference]: Without dead ends: 1107 [2019-11-26 02:21:25,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:21:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-26 02:21:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 926. [2019-11-26 02:21:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:21:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1096 transitions. [2019-11-26 02:21:25,309 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1096 transitions. Word has length 181 [2019-11-26 02:21:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:25,309 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1096 transitions. [2019-11-26 02:21:25,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:21:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1096 transitions. [2019-11-26 02:21:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-26 02:21:25,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:21:25,313 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-26 02:21:25,314 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:21:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:21:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1192338388, now seen corresponding path program 1 times [2019-11-26 02:21:25,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:21:25,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012847662] [2019-11-26 02:21:25,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:21:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-26 02:21:25,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012847662] [2019-11-26 02:21:25,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752585849] [2019-11-26 02:21:25,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:21:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:21:25,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:21:25,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:21:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-26 02:21:25,686 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:21:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-26 02:21:25,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:21:25,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:21:25,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665620761] [2019-11-26 02:21:25,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:21:25,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:21:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:21:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:21:25,776 INFO L87 Difference]: Start difference. First operand 926 states and 1096 transitions. Second operand 3 states. [2019-11-26 02:21:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:21:26,152 INFO L93 Difference]: Finished difference Result 1849 states and 2208 transitions. [2019-11-26 02:21:26,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:21:26,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-26 02:21:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:21:26,154 INFO L225 Difference]: With dead ends: 1849 [2019-11-26 02:21:26,155 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:21:26,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:21:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:21:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:21:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:21:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:21:26,157 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2019-11-26 02:21:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:21:26,157 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:21:26,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:21:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:21:26,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:21:26,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:21:26,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:21:26,481 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 73 [2019-11-26 02:21:26,799 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-11-26 02:21:27,068 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-11-26 02:21:27,071 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:21:27,071 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:21:27,071 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:21:27,072 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a16~0 6))) (.cse3 (not (= 1 ~a7~0))) (.cse4 (not (= 14 ~a8~0))) (.cse2 (<= ~a20~0 0)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (or (= 13 ~a8~0) (and .cse0 .cse1 .cse2) (and (or (and .cse0 .cse3) (and .cse0 .cse4)) .cse1 .cse5) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2) (and .cse1 .cse5 (= ~a16~0 5)))) [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:21:27,073 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:21:27,074 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a16~0 6))) (.cse3 (not (= 1 ~a7~0))) (.cse4 (not (= 14 ~a8~0))) (.cse2 (<= ~a20~0 0)) (.cse1 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (or (= 13 ~a8~0) (and .cse0 .cse1 .cse2) (and (or (and .cse0 .cse3) (and .cse0 .cse4)) .cse1 .cse5) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2) (and .cse1 .cse5 (= ~a16~0 5)))) [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:21:27,075 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:21:27,076 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:21:27,077 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:21:27,077 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:21:27,077 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:21:27,077 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:21:27,077 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:21:27,085 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:21:27,086 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:21:27,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:21:27 BoogieIcfgContainer [2019-11-26 02:21:27,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:21:27,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:21:27,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:21:27,116 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:21:27,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:21:19" (3/4) ... [2019-11-26 02:21:27,120 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:21:27,148 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:21:27,150 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:21:27,151 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:21:27,153 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:21:27,336 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f0ac32c9-fa2c-4841-a153-5c409e9f5d9a/bin/utaipan/witness.graphml [2019-11-26 02:21:27,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:21:27,338 INFO L168 Benchmark]: Toolchain (without parser) took 10613.34 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 91.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:27,338 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:21:27,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 642.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -82.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:27,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:27,339 INFO L168 Benchmark]: Boogie Preprocessor took 95.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:27,340 INFO L168 Benchmark]: RCFGBuilder took 2034.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 802.8 MB in the end (delta: 208.0 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:27,340 INFO L168 Benchmark]: TraceAbstraction took 7552.76 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 802.8 MB in the beginning and 1.1 GB in the end (delta: -342.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:21:27,340 INFO L168 Benchmark]: Witness Printer took 221.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:21:27,343 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 642.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 43.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -82.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2034.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 802.8 MB in the end (delta: 208.0 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7552.76 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 230.7 MB). Free memory was 802.8 MB in the beginning and 1.1 GB in the end (delta: -342.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 221.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((13 == a8 || ((!(a16 == 6) && a21 == 1) && a20 <= 0)) || ((((!(a16 == 6) && !(1 == a7)) || (!(a16 == 6) && !(14 == a8))) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a20 == 1) && !(14 == a8)) && a21 == 1)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((a21 == 1 && a20 == 1) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((13 == a8 || ((!(a16 == 6) && a21 == 1) && a20 <= 0)) || ((((!(a16 == 6) && !(1 == a7)) || (!(a16 == 6) && !(14 == a8))) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a20 == 1) && !(14 == a8)) && a21 == 1)) || (((!(1 == a7) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((a21 == 1 && a20 == 1) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 334 SDtfs, 1165 SDslu, 76 SDs, 0 SdLazy, 2902 SolverSat, 685 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 435 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1050 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7157 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1028 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1439 NumberOfCodeBlocks, 1439 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 576538 SizeOfPredicates, 1 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1845/1872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...