./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label07.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_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label07.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/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 e1aefec8ddab0c97dfdccb598d218efc3fd3f309 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:40,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:52:40,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:52:40,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:52:40,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:52:40,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:52:40,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:52:40,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:52:40,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:52:40,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:52:40,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:52:40,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:52:40,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:52:40,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:52:40,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:52:40,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:52:40,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:52:40,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:52:40,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:52:40,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:52:40,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:52:40,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:52:40,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:52:40,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:52:40,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:52:40,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:52:40,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:52:40,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:52:40,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:52:40,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:52:40,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:52:40,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:52:40,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:52:40,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:52:40,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:52:40,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:52:40,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:52:40,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:52:40,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:52:40,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:52:40,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:52:40,523 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:52:40,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:52:40,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:52:40,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:52:40,549 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:52:40,549 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:52:40,549 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:52:40,549 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:52:40,549 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:52:40,550 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:52:40,550 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:52:40,550 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:52:40,550 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:52:40,550 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:52:40,551 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:52:40,551 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:52:40,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:52:40,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:52:40,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:52:40,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:52:40,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:52:40,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:52:40,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:52:40,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:52:40,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:52:40,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:52:40,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:52:40,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:52:40,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:52:40,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:52:40,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:52:40,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:52:40,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:52:40,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:52:40,555 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:52:40,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:52:40,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:52:40,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:52:40,555 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_2a56c9bc-be56-485b-a554-0dc4c3284c10/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 -> e1aefec8ddab0c97dfdccb598d218efc3fd3f309 [2019-11-26 02:52:40,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:52:40,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:52:40,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:52:40,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:52:40,721 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:52:40,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label07.c [2019-11-26 02:52:40,780 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/data/8cd242b50/1127122c10824b4db032b822fb013e01/FLAG3310ed62f [2019-11-26 02:52:41,278 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:52:41,282 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/sv-benchmarks/c/eca-rers2012/Problem02_label07.c [2019-11-26 02:52:41,293 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/data/8cd242b50/1127122c10824b4db032b822fb013e01/FLAG3310ed62f [2019-11-26 02:52:41,792 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/data/8cd242b50/1127122c10824b4db032b822fb013e01 [2019-11-26 02:52:41,794 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:52:41,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:52:41,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:52:41,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:52:41,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:52:41,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:52:41" (1/1) ... [2019-11-26 02:52:41,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b23f1cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:41, skipping insertion in model container [2019-11-26 02:52:41,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:52:41" (1/1) ... [2019-11-26 02:52:41,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:52:41,855 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:52:42,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:52:42,252 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:52:42,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:52:42,407 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:52:42,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42 WrapperNode [2019-11-26 02:52:42,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:52:42,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:52:42,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:52:42,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:52:42,417 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:52:42" (1/1) ... [2019-11-26 02:52:42,433 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:52:42" (1/1) ... [2019-11-26 02:52:42,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:52:42,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:52:42,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:52:42,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:52:42,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... [2019-11-26 02:52:42,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:52:42,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:52:42,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:52:42,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:52:42,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/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:52:42,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:52:42,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:52:44,839 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:52:44,840 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:52:44,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:44 BoogieIcfgContainer [2019-11-26 02:52:44,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:52:44,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:52:44,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:52:44,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:52:44,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:52:41" (1/3) ... [2019-11-26 02:52:44,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309de75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:52:44, skipping insertion in model container [2019-11-26 02:52:44,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:42" (2/3) ... [2019-11-26 02:52:44,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309de75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:52:44, skipping insertion in model container [2019-11-26 02:52:44,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:44" (3/3) ... [2019-11-26 02:52:44,853 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label07.c [2019-11-26 02:52:44,886 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:52:44,901 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:52:44,911 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:52:44,948 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:52:44,948 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:52:44,948 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:52:44,948 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:52:44,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:52:44,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:52:44,949 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:52:44,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:52:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:52:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:52:44,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:44,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:44,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:44,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash 925963279, now seen corresponding path program 1 times [2019-11-26 02:52:45,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:45,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891404563] [2019-11-26 02:52:45,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:45,408 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:52:45,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891404563] [2019-11-26 02:52:45,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:45,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:52:45,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936054237] [2019-11-26 02:52:45,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:52:45,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:52:45,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:52:45,435 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-26 02:52:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:46,312 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-26 02:52:46,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:52:46,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:52:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:46,329 INFO L225 Difference]: With dead ends: 333 [2019-11-26 02:52:46,330 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:52:46,333 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:52:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:52:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-26 02:52:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-26 02:52:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-11-26 02:52:46,405 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-11-26 02:52:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:46,406 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-11-26 02:52:46,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:52:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-11-26 02:52:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-26 02:52:46,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:46,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:46,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2010269746, now seen corresponding path program 1 times [2019-11-26 02:52:46,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:46,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436215856] [2019-11-26 02:52:46,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:52:46,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436215856] [2019-11-26 02:52:46,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:46,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:52:46,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565907751] [2019-11-26 02:52:46,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:52:46,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:46,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:52:46,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:52:46,556 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 4 states. [2019-11-26 02:52:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:47,157 INFO L93 Difference]: Finished difference Result 805 states and 1286 transitions. [2019-11-26 02:52:47,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:52:47,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-26 02:52:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:47,162 INFO L225 Difference]: With dead ends: 805 [2019-11-26 02:52:47,162 INFO L226 Difference]: Without dead ends: 563 [2019-11-26 02:52:47,164 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:52:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-26 02:52:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 483. [2019-11-26 02:52:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-26 02:52:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 758 transitions. [2019-11-26 02:52:47,224 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 758 transitions. Word has length 89 [2019-11-26 02:52:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:47,224 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 758 transitions. [2019-11-26 02:52:47,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:52:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 758 transitions. [2019-11-26 02:52:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:52:47,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:47,230 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,230 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1900007154, now seen corresponding path program 1 times [2019-11-26 02:52:47,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:47,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906404180] [2019-11-26 02:52:47,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:52:47,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906404180] [2019-11-26 02:52:47,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:47,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:52:47,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538935302] [2019-11-26 02:52:47,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:52:47,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:52:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:52:47,296 INFO L87 Difference]: Start difference. First operand 483 states and 758 transitions. Second operand 3 states. [2019-11-26 02:52:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:47,705 INFO L93 Difference]: Finished difference Result 1285 states and 2020 transitions. [2019-11-26 02:52:47,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:52:47,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-26 02:52:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:47,709 INFO L225 Difference]: With dead ends: 1285 [2019-11-26 02:52:47,709 INFO L226 Difference]: Without dead ends: 803 [2019-11-26 02:52:47,711 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:52:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-11-26 02:52:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2019-11-26 02:52:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-26 02:52:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1153 transitions. [2019-11-26 02:52:47,736 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1153 transitions. Word has length 113 [2019-11-26 02:52:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:47,736 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1153 transitions. [2019-11-26 02:52:47,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:52:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1153 transitions. [2019-11-26 02:52:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-26 02:52:47,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:47,742 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-26 02:52:47,742 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1735805163, now seen corresponding path program 1 times [2019-11-26 02:52:47,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143560314] [2019-11-26 02:52:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:52:47,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143560314] [2019-11-26 02:52:47,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:47,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:52:47,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568777949] [2019-11-26 02:52:47,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:52:47,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:52:47,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:52:47,822 INFO L87 Difference]: Start difference. First operand 803 states and 1153 transitions. Second operand 4 states. [2019-11-26 02:52:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:48,454 INFO L93 Difference]: Finished difference Result 2005 states and 2890 transitions. [2019-11-26 02:52:48,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:52:48,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-26 02:52:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:48,461 INFO L225 Difference]: With dead ends: 2005 [2019-11-26 02:52:48,461 INFO L226 Difference]: Without dead ends: 1203 [2019-11-26 02:52:48,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:52:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-26 02:52:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 803. [2019-11-26 02:52:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-11-26 02:52:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1058 transitions. [2019-11-26 02:52:48,495 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1058 transitions. Word has length 118 [2019-11-26 02:52:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:48,495 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1058 transitions. [2019-11-26 02:52:48,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:52:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1058 transitions. [2019-11-26 02:52:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-26 02:52:48,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:48,499 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:48,499 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:48,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1692460679, now seen corresponding path program 1 times [2019-11-26 02:52:48,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:48,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872653299] [2019-11-26 02:52:48,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:52:48,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872653299] [2019-11-26 02:52:48,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:48,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:52:48,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102338832] [2019-11-26 02:52:48,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:52:48,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:52:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:52:48,586 INFO L87 Difference]: Start difference. First operand 803 states and 1058 transitions. Second operand 3 states. [2019-11-26 02:52:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:49,019 INFO L93 Difference]: Finished difference Result 2085 states and 2741 transitions. [2019-11-26 02:52:49,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:52:49,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-26 02:52:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:49,026 INFO L225 Difference]: With dead ends: 2085 [2019-11-26 02:52:49,026 INFO L226 Difference]: Without dead ends: 1203 [2019-11-26 02:52:49,027 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:52:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-26 02:52:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-11-26 02:52:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-26 02:52:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1345 transitions. [2019-11-26 02:52:49,059 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1345 transitions. Word has length 131 [2019-11-26 02:52:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:49,061 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1345 transitions. [2019-11-26 02:52:49,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:52:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1345 transitions. [2019-11-26 02:52:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-26 02:52:49,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:49,064 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,064 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1947476812, now seen corresponding path program 1 times [2019-11-26 02:52:49,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:49,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910432516] [2019-11-26 02:52:49,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:52:49,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910432516] [2019-11-26 02:52:49,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:49,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:52:49,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003291197] [2019-11-26 02:52:49,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:52:49,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:52:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:52:49,150 INFO L87 Difference]: Start difference. First operand 1043 states and 1345 transitions. Second operand 3 states. [2019-11-26 02:52:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:49,532 INFO L93 Difference]: Finished difference Result 2485 states and 3180 transitions. [2019-11-26 02:52:49,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:52:49,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-26 02:52:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:49,539 INFO L225 Difference]: With dead ends: 2485 [2019-11-26 02:52:49,539 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:52:49,541 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:52:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:52:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-26 02:52:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-26 02:52:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1245 transitions. [2019-11-26 02:52:49,569 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1245 transitions. Word has length 140 [2019-11-26 02:52:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:49,570 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1245 transitions. [2019-11-26 02:52:49,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:52:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1245 transitions. [2019-11-26 02:52:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-26 02:52:49,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:49,573 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:52:49,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 283727443, now seen corresponding path program 1 times [2019-11-26 02:52:49,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:49,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217104981] [2019-11-26 02:52:49,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-26 02:52:49,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217104981] [2019-11-26 02:52:49,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:49,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:52:49,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898191208] [2019-11-26 02:52:49,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:52:49,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:49,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:52:49,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:52:49,682 INFO L87 Difference]: Start difference. First operand 1043 states and 1245 transitions. Second operand 4 states. [2019-11-26 02:52:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:50,172 INFO L93 Difference]: Finished difference Result 2245 states and 2669 transitions. [2019-11-26 02:52:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:52:50,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-26 02:52:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:50,177 INFO L225 Difference]: With dead ends: 2245 [2019-11-26 02:52:50,177 INFO L226 Difference]: Without dead ends: 803 [2019-11-26 02:52:50,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:52:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-11-26 02:52:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 723. [2019-11-26 02:52:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-26 02:52:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 779 transitions. [2019-11-26 02:52:50,195 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 779 transitions. Word has length 150 [2019-11-26 02:52:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:50,195 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 779 transitions. [2019-11-26 02:52:50,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:52:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 779 transitions. [2019-11-26 02:52:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-26 02:52:50,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:50,199 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:52:50,199 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 67834797, now seen corresponding path program 1 times [2019-11-26 02:52:50,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:50,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833541236] [2019-11-26 02:52:50,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 207 proven. 61 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:52:50,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833541236] [2019-11-26 02:52:50,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190422472] [2019-11-26 02:52:50,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/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:52:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:50,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:52:50,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-26 02:52:50,764 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-26 02:52:50,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:52:50,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 11 [2019-11-26 02:52:50,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498266044] [2019-11-26 02:52:50,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:52:50,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:52:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:52:50,829 INFO L87 Difference]: Start difference. First operand 723 states and 779 transitions. Second operand 4 states. [2019-11-26 02:52:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:51,123 INFO L93 Difference]: Finished difference Result 1283 states and 1375 transitions. [2019-11-26 02:52:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:52:51,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-26 02:52:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:51,125 INFO L225 Difference]: With dead ends: 1283 [2019-11-26 02:52:51,125 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:52:51,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:52:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:52:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:52:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:52:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:52:51,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 221 [2019-11-26 02:52:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:51,127 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:52:51,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:52:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:52:51,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:52:51,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:51,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:52:51,563 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-26 02:52:51,712 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:52:51,716 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:52:51,717 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:52:51,718 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:52:51,719 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 589) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:52:51,720 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:52:51,721 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:52:51,721 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:52:51,727 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse3 (= ~a17~0 8))) (let ((.cse2 (or (and (not .cse5) .cse4) (and (<= ~a19~0 0) .cse3))) (.cse1 (= ~a11~0 1)) (.cse0 (= ~a25~0 1))) (or (and (<= ~a17~0 7) (= ~a28~0 7) .cse0 .cse1) (and (= ~a28~0 10) .cse1) (and .cse2 .cse1) (and (< ~a17~0 9) .cse2) (and .cse3 .cse1 .cse4) (and .cse3 .cse5 .cse0) (and (not (= ~a28~0 8)) .cse3 .cse4)))) [2019-11-26 02:52:51,728 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:52:51,728 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:52:51,729 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:52:51,730 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:52:51,731 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:52:51,731 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:52:51,731 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:52:51,731 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:52:51,731 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:52:51,731 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:52:51,732 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a19~0 1)) (.cse4 (not (= ~a28~0 11))) (.cse3 (= ~a17~0 8))) (let ((.cse2 (or (and (not .cse5) .cse4) (and (<= ~a19~0 0) .cse3))) (.cse1 (= ~a11~0 1)) (.cse0 (= ~a25~0 1))) (or (and (<= ~a17~0 7) (= ~a28~0 7) .cse0 .cse1) (and (= ~a28~0 10) .cse1) (and .cse2 .cse1) (and (< ~a17~0 9) .cse2) (and .cse3 .cse1 .cse4) (and .cse3 .cse5 .cse0) (and (not (= ~a28~0 8)) .cse3 .cse4)))) [2019-11-26 02:52:51,732 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:52:51,732 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:52:51,732 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:52:51,732 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:52:51,733 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:52:51,733 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:52:51,733 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:52:51,733 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:52:51,733 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:52:51,733 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:52:51,734 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:52:51,734 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:52:51,734 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:52:51,734 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:52:51,734 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:52:51,734 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:52:51,735 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:52:51,735 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:52:51,735 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:52:51,735 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:52:51,735 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:52:51,735 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:52:51,736 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:52:51,736 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:52:51,736 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:52:51,736 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:52:51,736 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:52:51,736 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:52:51,737 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:52:51,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:52:51 BoogieIcfgContainer [2019-11-26 02:52:51,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:52:51,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:52:51,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:52:51,773 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:52:51,773 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:44" (3/4) ... [2019-11-26 02:52:51,777 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:52:51,807 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-11-26 02:52:51,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:52:51,811 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:52:51,813 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:52:52,002 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2a56c9bc-be56-485b-a554-0dc4c3284c10/bin/utaipan/witness.graphml [2019-11-26 02:52:52,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:52:52,003 INFO L168 Benchmark]: Toolchain (without parser) took 10208.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 268.4 MB). Free memory was 939.4 MB in the beginning and 874.9 MB in the end (delta: 64.6 MB). Peak memory consumption was 333.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,003 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:52,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,004 INFO L168 Benchmark]: Boogie Preprocessor took 71.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,005 INFO L168 Benchmark]: RCFGBuilder took 2286.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.0 MB in the end (delta: 221.5 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,005 INFO L168 Benchmark]: TraceAbstraction took 6927.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 870.0 MB in the beginning and 895.1 MB in the end (delta: -25.0 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,005 INFO L168 Benchmark]: Witness Printer took 229.40 ms. Allocated memory is still 1.3 GB. Free memory was 895.1 MB in the beginning and 874.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:52,007 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2286.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.0 MB in the end (delta: 221.5 MB). Peak memory consumption was 221.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6927.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 870.0 MB in the beginning and 895.1 MB in the end (delta: -25.0 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. * Witness Printer took 229.40 ms. Allocated memory is still 1.3 GB. Free memory was 895.1 MB in the beginning and 874.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 589]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((a17 <= 7 && a28 == 7) && a25 == 1) && a11 == 1) || (a28 == 10 && a11 == 1)) || (((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || ((a17 == 8 && a11 == 1) && !(a28 == 11))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || ((!(a28 == 8) && a17 == 8) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((a17 <= 7 && a28 == 7) && a25 == 1) && a11 == 1) || (a28 == 10 && a11 == 1)) || (((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)) && a11 == 1)) || (a17 < 9 && ((!(a19 == 1) && !(a28 == 11)) || (a19 <= 0 && a17 == 8)))) || ((a17 == 8 && a11 == 1) && !(a28 == 11))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || ((!(a28 == 8) && a17 == 8) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 554 SDtfs, 1074 SDslu, 63 SDs, 0 SdLazy, 2578 SolverSat, 695 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 450 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 720 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 193 HoareAnnotationTreeSize, 3 FomulaSimplifications, 486 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 524 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1263 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1474 ConstructedInterpolants, 0 QuantifiedInterpolants, 642244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1215/1276 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...