./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label27.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_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/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 e1af67db67a88433de1a31e57b46e50dcbb6e7d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:37:18,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:37:18,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:37:18,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:37:18,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:37:18,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:37:18,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:37:18,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:37:18,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:37:18,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:37:18,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:37:18,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:37:18,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:37:18,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:37:18,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:37:18,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:37:18,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:37:18,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:37:18,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:37:18,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:37:18,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:37:18,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:37:18,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:37:18,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:37:18,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:37:18,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:37:18,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:37:18,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:37:18,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:37:18,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:37:18,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:37:18,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:37:18,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:37:18,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:37:18,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:37:18,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:37:18,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:37:18,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:37:18,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:37:18,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:37:18,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:37:18,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:37:18,552 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:37:18,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:37:18,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:37:18,553 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:37:18,553 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:37:18,554 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:37:18,554 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:37:18,554 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:37:18,554 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:37:18,554 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:37:18,555 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:37:18,555 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:37:18,555 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:37:18,555 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:37:18,556 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:37:18,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:37:18,556 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:37:18,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:37:18,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:37:18,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:37:18,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:37:18,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:37:18,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:37:18,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:37:18,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:37:18,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:37:18,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:37:18,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:37:18,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:37:18,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:37:18,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:37:18,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:37:18,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:37:18,560 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:37:18,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:37:18,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:37:18,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:37:18,561 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_9824b1c3-23db-4424-b4d8-cb7fcfb26308/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 -> e1af67db67a88433de1a31e57b46e50dcbb6e7d8 [2019-11-26 02:37:18,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:37:18,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:37:18,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:37:18,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:37:18,720 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:37:18,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2019-11-26 02:37:18,781 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/data/2478fd6f9/4bea4066e5894aa49ea5954b5febe71a/FLAG3d7a7ae18 [2019-11-26 02:37:19,298 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:37:19,299 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/sv-benchmarks/c/eca-rers2012/Problem01_label27.c [2019-11-26 02:37:19,310 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/data/2478fd6f9/4bea4066e5894aa49ea5954b5febe71a/FLAG3d7a7ae18 [2019-11-26 02:37:19,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/data/2478fd6f9/4bea4066e5894aa49ea5954b5febe71a [2019-11-26 02:37:19,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:37:19,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:37:19,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:19,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:37:19,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:37:19,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:19" (1/1) ... [2019-11-26 02:37:19,809 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:37:19, skipping insertion in model container [2019-11-26 02:37:19,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:19" (1/1) ... [2019-11-26 02:37:19,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:37:19,877 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:37:20,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:37:20,393 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:37:20,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:37:20,508 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:37:20,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20 WrapperNode [2019-11-26 02:37:20,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:20,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:37:20,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:37:20,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:37:20,519 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:37:20" (1/1) ... [2019-11-26 02:37:20,538 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:37:20" (1/1) ... [2019-11-26 02:37:20,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:37:20,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:37:20,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:37:20,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:37:20,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... [2019-11-26 02:37:20,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:37:20,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:37:20,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:37:20,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:37:20,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/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:37:20,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:37:20,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:37:22,901 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:37:22,901 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:37:22,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:22 BoogieIcfgContainer [2019-11-26 02:37:22,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:37:22,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:37:22,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:37:22,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:37:22,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:37:19" (1/3) ... [2019-11-26 02:37:22,908 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:37:22, skipping insertion in model container [2019-11-26 02:37:22,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:20" (2/3) ... [2019-11-26 02:37:22,909 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:37:22, skipping insertion in model container [2019-11-26 02:37:22,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:22" (3/3) ... [2019-11-26 02:37:22,911 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label27.c [2019-11-26 02:37:22,920 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:37:22,926 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:37:22,937 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:37:22,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:37:22,961 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:37:22,961 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:37:22,961 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:37:22,961 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:37:22,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:37:22,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:37:22,962 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:37:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:37:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:37:22,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:22,991 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:37:22,991 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245599, now seen corresponding path program 1 times [2019-11-26 02:37:23,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:23,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661796503] [2019-11-26 02:37:23,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:23,398 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:37:23,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661796503] [2019-11-26 02:37:23,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:23,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:37:23,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756972964] [2019-11-26 02:37:23,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:23,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:23,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:23,424 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-26 02:37:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:23,970 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-26 02:37:23,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:23,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-26 02:37:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:23,985 INFO L225 Difference]: With dead ends: 224 [2019-11-26 02:37:23,985 INFO L226 Difference]: Without dead ends: 145 [2019-11-26 02:37:23,988 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:37:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-26 02:37:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-26 02:37:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:37:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:37:24,057 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:37:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:24,058 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:37:24,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:37:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 02:37:24,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:24,064 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-26 02:37:24,065 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:24,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash 585772121, now seen corresponding path program 1 times [2019-11-26 02:37:24,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:24,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653476989] [2019-11-26 02:37:24,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:24,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653476989] [2019-11-26 02:37:24,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:24,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:24,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257905743] [2019-11-26 02:37:24,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:24,165 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:37:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:24,597 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-26 02:37:24,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:24,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-26 02:37:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:24,600 INFO L225 Difference]: With dead ends: 431 [2019-11-26 02:37:24,600 INFO L226 Difference]: Without dead ends: 287 [2019-11-26 02:37:24,602 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:37:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-26 02:37:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-26 02:37:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 02:37:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 480 transitions. [2019-11-26 02:37:24,639 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 480 transitions. Word has length 76 [2019-11-26 02:37:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:24,639 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 480 transitions. [2019-11-26 02:37:24,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 480 transitions. [2019-11-26 02:37:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:37:24,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:24,649 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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:37:24,649 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 919984079, now seen corresponding path program 1 times [2019-11-26 02:37:24,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:24,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640607775] [2019-11-26 02:37:24,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:24,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640607775] [2019-11-26 02:37:24,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:24,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:24,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146054074] [2019-11-26 02:37:24,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:24,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:24,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:24,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:24,751 INFO L87 Difference]: Start difference. First operand 287 states and 480 transitions. Second operand 4 states. [2019-11-26 02:37:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:25,460 INFO L93 Difference]: Finished difference Result 1141 states and 1915 transitions. [2019-11-26 02:37:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:25,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:37:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:25,467 INFO L225 Difference]: With dead ends: 1141 [2019-11-26 02:37:25,468 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:37:25,470 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:37:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:37:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-26 02:37:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:37:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1328 transitions. [2019-11-26 02:37:25,512 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1328 transitions. Word has length 80 [2019-11-26 02:37:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:25,513 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1328 transitions. [2019-11-26 02:37:25,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1328 transitions. [2019-11-26 02:37:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 02:37:25,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:25,515 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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:37:25,515 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1341144070, now seen corresponding path program 1 times [2019-11-26 02:37:25,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:25,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622862342] [2019-11-26 02:37:25,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:37:25,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622862342] [2019-11-26 02:37:25,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:25,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:37:25,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746352050] [2019-11-26 02:37:25,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:25,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:25,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:25,571 INFO L87 Difference]: Start difference. First operand 855 states and 1328 transitions. Second operand 3 states. [2019-11-26 02:37:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:25,946 INFO L93 Difference]: Finished difference Result 1851 states and 2900 transitions. [2019-11-26 02:37:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:25,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-26 02:37:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:25,953 INFO L225 Difference]: With dead ends: 1851 [2019-11-26 02:37:25,953 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:37:25,956 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:37:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:37:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 713. [2019-11-26 02:37:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:37:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1101 transitions. [2019-11-26 02:37:25,981 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1101 transitions. Word has length 83 [2019-11-26 02:37:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:25,981 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1101 transitions. [2019-11-26 02:37:25,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1101 transitions. [2019-11-26 02:37:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:37:25,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:25,983 INFO L410 BasicCegarLoop]: trace histogram [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, 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:37:25,983 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1986457344, now seen corresponding path program 1 times [2019-11-26 02:37:25,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:25,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167859722] [2019-11-26 02:37:25,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:26,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167859722] [2019-11-26 02:37:26,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:26,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:26,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900859324] [2019-11-26 02:37:26,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:26,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:26,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:26,073 INFO L87 Difference]: Start difference. First operand 713 states and 1101 transitions. Second operand 4 states. [2019-11-26 02:37:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:26,551 INFO L93 Difference]: Finished difference Result 1516 states and 2310 transitions. [2019-11-26 02:37:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:37:26,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-26 02:37:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:26,556 INFO L225 Difference]: With dead ends: 1516 [2019-11-26 02:37:26,557 INFO L226 Difference]: Without dead ends: 804 [2019-11-26 02:37:26,558 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:37:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-11-26 02:37:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 784. [2019-11-26 02:37:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:37:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1178 transitions. [2019-11-26 02:37:26,589 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1178 transitions. Word has length 86 [2019-11-26 02:37:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:26,590 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1178 transitions. [2019-11-26 02:37:26,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1178 transitions. [2019-11-26 02:37:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-26 02:37:26,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:26,596 INFO L410 BasicCegarLoop]: trace histogram [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, 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:37:26,597 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:26,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1981861432, now seen corresponding path program 1 times [2019-11-26 02:37:26,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:26,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859034405] [2019-11-26 02:37:26,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:26,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859034405] [2019-11-26 02:37:26,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:26,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:26,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573070883] [2019-11-26 02:37:26,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:26,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:26,689 INFO L87 Difference]: Start difference. First operand 784 states and 1178 transitions. Second operand 4 states. [2019-11-26 02:37:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:27,235 INFO L93 Difference]: Finished difference Result 1496 states and 2278 transitions. [2019-11-26 02:37:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:27,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-26 02:37:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:27,240 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:37:27,240 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:37:27,242 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:37:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:37:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-26 02:37:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:37:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1160 transitions. [2019-11-26 02:37:27,264 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1160 transitions. Word has length 90 [2019-11-26 02:37:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:27,267 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1160 transitions. [2019-11-26 02:37:27,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1160 transitions. [2019-11-26 02:37:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-26 02:37:27,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:27,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 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:37:27,271 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1637095950, now seen corresponding path program 1 times [2019-11-26 02:37:27,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:27,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307124198] [2019-11-26 02:37:27,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:37:27,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307124198] [2019-11-26 02:37:27,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:27,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:37:27,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756066778] [2019-11-26 02:37:27,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:27,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:27,350 INFO L87 Difference]: Start difference. First operand 784 states and 1160 transitions. Second operand 3 states. [2019-11-26 02:37:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:27,743 INFO L93 Difference]: Finished difference Result 1496 states and 2242 transitions. [2019-11-26 02:37:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-26 02:37:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:27,749 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:37:27,749 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:37:27,750 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:37:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:37:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-26 02:37:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:37:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1148 transitions. [2019-11-26 02:37:27,775 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1148 transitions. Word has length 91 [2019-11-26 02:37:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:27,775 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1148 transitions. [2019-11-26 02:37:27,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1148 transitions. [2019-11-26 02:37:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:37:27,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:27,777 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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:37:27,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1728902547, now seen corresponding path program 1 times [2019-11-26 02:37:27,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:27,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938160235] [2019-11-26 02:37:27,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:27,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938160235] [2019-11-26 02:37:27,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:27,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:27,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4768399] [2019-11-26 02:37:27,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:27,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:27,846 INFO L87 Difference]: Start difference. First operand 784 states and 1148 transitions. Second operand 3 states. [2019-11-26 02:37:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:28,180 INFO L93 Difference]: Finished difference Result 1709 states and 2517 transitions. [2019-11-26 02:37:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:28,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-26 02:37:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:28,185 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:37:28,185 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:37:28,187 INFO L630 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-11-26 02:37:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:37:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 855. [2019-11-26 02:37:28,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:37:28,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1024 transitions. [2019-11-26 02:37:28,209 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1024 transitions. Word has length 93 [2019-11-26 02:37:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:28,209 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1024 transitions. [2019-11-26 02:37:28,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1024 transitions. [2019-11-26 02:37:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:37:28,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:28,212 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-26 02:37:28,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2105522167, now seen corresponding path program 1 times [2019-11-26 02:37:28,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:28,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989289410] [2019-11-26 02:37:28,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:28,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989289410] [2019-11-26 02:37:28,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:28,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:28,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100339182] [2019-11-26 02:37:28,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:28,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:28,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:28,327 INFO L87 Difference]: Start difference. First operand 855 states and 1024 transitions. Second operand 4 states. [2019-11-26 02:37:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:28,796 INFO L93 Difference]: Finished difference Result 1709 states and 2069 transitions. [2019-11-26 02:37:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:28,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-26 02:37:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:28,801 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:37:28,801 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:37:28,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:37:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:37:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-26 02:37:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:37:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 888 transitions. [2019-11-26 02:37:28,821 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 888 transitions. Word has length 108 [2019-11-26 02:37:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:28,821 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 888 transitions. [2019-11-26 02:37:28,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 888 transitions. [2019-11-26 02:37:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:37:28,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:28,824 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-26 02:37:28,824 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1361905208, now seen corresponding path program 1 times [2019-11-26 02:37:28,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:28,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929225798] [2019-11-26 02:37:28,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:37:28,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929225798] [2019-11-26 02:37:28,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:28,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:28,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680101822] [2019-11-26 02:37:28,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:28,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:37:28,909 INFO L87 Difference]: Start difference. First operand 784 states and 888 transitions. Second operand 3 states. [2019-11-26 02:37:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:29,240 INFO L93 Difference]: Finished difference Result 1993 states and 2281 transitions. [2019-11-26 02:37:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:29,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-26 02:37:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:29,246 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:37:29,247 INFO L226 Difference]: Without dead ends: 1210 [2019-11-26 02:37:29,248 INFO L630 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-11-26 02:37:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-26 02:37:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2019-11-26 02:37:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-26 02:37:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1362 transitions. [2019-11-26 02:37:29,278 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1362 transitions. Word has length 121 [2019-11-26 02:37:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:29,278 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 1362 transitions. [2019-11-26 02:37:29,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1362 transitions. [2019-11-26 02:37:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-26 02:37:29,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:29,281 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2019-11-26 02:37:29,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1351609120, now seen corresponding path program 1 times [2019-11-26 02:37:29,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:29,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546714555] [2019-11-26 02:37:29,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:29,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546714555] [2019-11-26 02:37:29,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097353753] [2019-11-26 02:37:29,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/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:37:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:29,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:37:29,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:37:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:37:29,660 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:37:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:37:29,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:37:29,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-26 02:37:29,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225486004] [2019-11-26 02:37:29,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:37:29,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:37:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:37:29,692 INFO L87 Difference]: Start difference. First operand 1210 states and 1362 transitions. Second operand 3 states. [2019-11-26 02:37:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:30,005 INFO L93 Difference]: Finished difference Result 2632 states and 2981 transitions. [2019-11-26 02:37:30,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:37:30,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-11-26 02:37:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:30,011 INFO L225 Difference]: With dead ends: 2632 [2019-11-26 02:37:30,011 INFO L226 Difference]: Without dead ends: 1210 [2019-11-26 02:37:30,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:37:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-26 02:37:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 997. [2019-11-26 02:37:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:37:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1116 transitions. [2019-11-26 02:37:30,041 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1116 transitions. Word has length 138 [2019-11-26 02:37:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:30,041 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1116 transitions. [2019-11-26 02:37:30,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:37:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1116 transitions. [2019-11-26 02:37:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-26 02:37:30,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:30,044 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2019-11-26 02:37:30,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:37:30,247 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash -748095685, now seen corresponding path program 1 times [2019-11-26 02:37:30,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:30,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417717615] [2019-11-26 02:37:30,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:31,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417717615] [2019-11-26 02:37:31,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:31,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-26 02:37:31,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894589514] [2019-11-26 02:37:31,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:37:31,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:37:31,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:37:31,003 INFO L87 Difference]: Start difference. First operand 997 states and 1116 transitions. Second operand 12 states. [2019-11-26 02:37:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:31,882 INFO L93 Difference]: Finished difference Result 1972 states and 2204 transitions. [2019-11-26 02:37:31,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:37:31,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-11-26 02:37:31,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:31,883 INFO L225 Difference]: With dead ends: 1972 [2019-11-26 02:37:31,883 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:37:31,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:37:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:37:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:37:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:37:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:37:31,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2019-11-26 02:37:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:31,886 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:37:31,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:37:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:37:31,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:37:31,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:37:32,326 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-26 02:37:32,622 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:37:32,624 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-26 02:37:32,625 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:37:32,626 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a16~0 5)) (.cse3 (= ~a16~0 6)) (.cse4 (= 1 ~a7~0))) (let ((.cse5 (not (= ~a20~0 1))) (.cse10 (not .cse4)) (.cse6 (not .cse3)) (.cse0 (= ~a17~0 1)) (.cse7 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse8 (= 15 ~a8~0)) (.cse11 (not .cse9)) (.cse2 (<= ~a8~0 14))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1) (and .cse5 .cse7 .cse1 .cse8 .cse9) (and .cse10 .cse7 .cse1 .cse11 .cse8) (and .cse5 .cse1 .cse2 .cse9) (and .cse4 .cse6 .cse0 .cse1) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse7 (<= ~a17~0 0) .cse10 .cse1 .cse8) (and .cse4 .cse1 .cse2) (and .cse4 .cse0 .cse2) (and .cse6 .cse1 .cse11 .cse2) (and .cse0 .cse7 .cse1 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse8 .cse9) (and .cse4 .cse11 .cse2)))) [2019-11-26 02:37:32,626 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:37:32,626 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:37:32,626 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:37:32,626 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:37:32,626 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:37:32,627 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:37:32,628 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:37:32,628 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:37:32,628 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:37:32,628 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:37:32,628 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:37:32,628 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:37:32,629 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:37:32,633 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a16~0 5)) (.cse6 (= ~a16~0 6)) (.cse7 (= 1 ~a7~0))) (let ((.cse8 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse10 (not .cse7)) (.cse3 (= 15 ~a8~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not .cse6)) (.cse2 (= ~a21~0 1)) (.cse11 (not .cse4)) (.cse5 (<= ~a8~0 14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse1 .cse2 .cse11 .cse3) (and .cse8 .cse2 .cse5 .cse4) (and .cse7 .cse9 .cse0 .cse2) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 (<= ~a17~0 0) .cse10 .cse2 .cse3) (and .cse7 .cse2 .cse5) (and .cse7 .cse0 .cse5) (and .cse9 .cse2 .cse11 .cse5) (and .cse7 .cse11 .cse5)))) [2019-11-26 02:37:32,633 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:37:32,633 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:37:32,633 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:37:32,633 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:37:32,634 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:37:32,634 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:37:32,634 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:37:32,635 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:37:32,636 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:37:32,637 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:37:32,637 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:37:32,637 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-11-26 02:37:32,637 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:37:32,638 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:37:32,638 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:37:32,638 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:37:32,638 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:37:32,638 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:37:32,638 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:37:32,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:37:32 BoogieIcfgContainer [2019-11-26 02:37:32,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:37:32,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:37:32,682 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:37:32,683 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:37:32,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:22" (3/4) ... [2019-11-26 02:37:32,687 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:37:32,715 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:37:32,717 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:37:32,718 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:37:32,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:37:32,894 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9824b1c3-23db-4424-b4d8-cb7fcfb26308/bin/utaipan/witness.graphml [2019-11-26 02:37:32,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:37:32,895 INFO L168 Benchmark]: Toolchain (without parser) took 13100.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 939.4 MB in the beginning and 977.3 MB in the end (delta: -37.9 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:32,896 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:32,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:32,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.05 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:32,897 INFO L168 Benchmark]: Boogie Preprocessor took 86.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:32,897 INFO L168 Benchmark]: RCFGBuilder took 2224.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.6 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:32,897 INFO L168 Benchmark]: TraceAbstraction took 9777.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 895.6 MB in the beginning and 997.6 MB in the end (delta: -102.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:32,898 INFO L168 Benchmark]: Witness Printer took 211.90 ms. Allocated memory is still 1.3 GB. Free memory was 997.6 MB in the beginning and 977.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:32,900 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 710.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.05 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.32 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 2224.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.6 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9777.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 895.6 MB in the beginning and 997.6 MB in the end (delta: -102.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * Witness Printer took 211.90 ms. Allocated memory is still 1.3 GB. Free memory was 997.6 MB in the beginning and 977.3 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: (((((((((((((a17 == 1 && a21 == 1) && a8 <= 14) && a16 == 6) || (((1 == a7 && !(a20 == 1)) && !(a16 == 6)) && a21 == 1)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && !(a16 == 5)) && 15 == a8)) || (((!(a20 == 1) && a21 == 1) && a8 <= 14) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((((((2 == input || 3 == input) || 6 == input) || 5 == input) && a12 == 8) && a17 <= 0) && !(1 == a7)) && a21 == 1) && 15 == a8)) || ((1 == a7 && a21 == 1) && a8 <= 14)) || ((1 == a7 && a17 == 1) && a8 <= 14)) || (((!(a16 == 6) && a21 == 1) && !(a16 == 5)) && a8 <= 14)) || (((((a17 == 1 && a12 == 8) && a21 == 1) && !(1 == input)) && 15 == a8) && a16 == 5)) || ((1 == a7 && !(a16 == 5)) && a8 <= 14) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5) || (((a17 == 1 && a21 == 1) && a8 <= 14) && a16 == 6)) || (((1 == a7 && !(a20 == 1)) && !(a16 == 6)) && a21 == 1)) || ((((!(a20 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && !(a16 == 5)) && 15 == a8)) || (((!(a20 == 1) && a21 == 1) && a8 <= 14) && a16 == 5)) || (((1 == a7 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((((((2 == input || 3 == input) || 6 == input) || 5 == input) && a12 == 8) && a17 <= 0) && !(1 == a7)) && a21 == 1) && 15 == a8)) || ((1 == a7 && a21 == 1) && a8 <= 14)) || ((1 == a7 && a17 == 1) && a8 <= 14)) || (((!(a16 == 6) && a21 == 1) && !(a16 == 5)) && a8 <= 14)) || ((1 == a7 && !(a16 == 5)) && a8 <= 14) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 9.6s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 728 SDtfs, 1251 SDslu, 78 SDs, 0 SdLazy, 3565 SolverSat, 715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 293 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 730 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 373 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3021 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 218 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1315 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 807347 SizeOfPredicates, 1 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 585/586 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...