./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.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_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/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 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:08,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:36:08,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:36:08,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:36:08,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:36:08,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:36:08,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:36:08,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:36:08,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:36:08,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:36:08,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:36:08,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:36:08,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:36:08,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:36:08,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:36:08,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:36:08,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:36:08,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:36:08,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:36:08,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:36:08,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:36:08,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:36:08,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:36:08,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:36:08,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:36:08,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:36:08,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:36:08,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:36:08,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:36:08,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:36:08,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:36:08,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:36:08,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:36:08,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:36:08,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:36:08,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:36:08,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:36:08,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:36:08,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:36:08,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:36:08,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:36:08,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:36:08,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:36:08,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:36:08,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:36:08,458 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:36:08,458 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:36:08,458 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:36:08,458 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:36:08,459 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:36:08,459 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:36:08,459 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:36:08,459 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:36:08,459 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:36:08,460 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:36:08,460 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:36:08,460 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:36:08,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:36:08,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:36:08,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:36:08,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:36:08,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:36:08,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:36:08,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:36:08,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:36:08,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:36:08,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:36:08,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:36:08,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:36:08,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:36:08,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:36:08,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:36:08,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:36:08,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:36:08,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:36:08,465 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:36:08,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:36:08,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:36:08,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:36:08,465 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_3b5e5c46-df41-4c8e-aa66-6130efa34b50/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 -> 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b [2019-11-26 02:36:08,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:36:08,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:36:08,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:36:08,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:36:08,648 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:36:08,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-26 02:36:08,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/data/fdd9f87ef/8bdcfb9c95a049849ea682be8479b488/FLAG202721b56 [2019-11-26 02:36:09,182 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:36:09,183 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-26 02:36:09,193 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/data/fdd9f87ef/8bdcfb9c95a049849ea682be8479b488/FLAG202721b56 [2019-11-26 02:36:09,456 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/data/fdd9f87ef/8bdcfb9c95a049849ea682be8479b488 [2019-11-26 02:36:09,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:36:09,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:36:09,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:36:09,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:36:09,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:36:09,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:36:09" (1/1) ... [2019-11-26 02:36:09,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cc24e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:09, skipping insertion in model container [2019-11-26 02:36:09,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:36:09" (1/1) ... [2019-11-26 02:36:09,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:36:09,518 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:36:09,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:36:09,939 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:36:10,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:36:10,072 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:36:10,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10 WrapperNode [2019-11-26 02:36:10,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:36:10,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:36:10,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:36:10,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:36:10,081 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:36:10" (1/1) ... [2019-11-26 02:36:10,106 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:36:10" (1/1) ... [2019-11-26 02:36:10,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:36:10,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:36:10,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:36:10,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:36:10,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... [2019-11-26 02:36:10,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:36:10,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:36:10,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:36:10,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:36:10,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/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:36:10,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:36:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:36:12,009 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:36:12,010 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:36:12,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:36:12 BoogieIcfgContainer [2019-11-26 02:36:12,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:36:12,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:36:12,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:36:12,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:36:12,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:36:09" (1/3) ... [2019-11-26 02:36:12,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e093309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:36:12, skipping insertion in model container [2019-11-26 02:36:12,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:36:10" (2/3) ... [2019-11-26 02:36:12,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e093309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:36:12, skipping insertion in model container [2019-11-26 02:36:12,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:36:12" (3/3) ... [2019-11-26 02:36:12,020 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-11-26 02:36:12,030 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:36:12,037 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:36:12,048 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:36:12,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:36:12,078 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:36:12,079 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:36:12,079 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:36:12,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:36:12,079 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:36:12,079 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:36:12,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:36:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:36:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:36:12,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:12,110 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:36:12,111 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1323244319, now seen corresponding path program 1 times [2019-11-26 02:36:12,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:12,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451951826] [2019-11-26 02:36:12,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:12,489 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:36:12,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451951826] [2019-11-26 02:36:12,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:12,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:36:12,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539697691] [2019-11-26 02:36:12,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:12,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:12,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:12,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:12,515 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-26 02:36:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:13,021 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-26 02:36:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:13,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-26 02:36:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:13,038 INFO L225 Difference]: With dead ends: 224 [2019-11-26 02:36:13,038 INFO L226 Difference]: Without dead ends: 145 [2019-11-26 02:36:13,041 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:36:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-26 02:36:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-26 02:36:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:36:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:36:13,093 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:36:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:13,094 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:36:13,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:36:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 02:36:13,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:13,098 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:36:13,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash 585773401, now seen corresponding path program 1 times [2019-11-26 02:36:13,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:13,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876404884] [2019-11-26 02:36:13,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:13,146 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:36:13,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876404884] [2019-11-26 02:36:13,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:13,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:13,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317743900] [2019-11-26 02:36:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:13,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:13,150 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:36:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:13,592 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-26 02:36:13,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:13,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-26 02:36:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:13,596 INFO L225 Difference]: With dead ends: 431 [2019-11-26 02:36:13,596 INFO L226 Difference]: Without dead ends: 287 [2019-11-26 02:36:13,597 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:36:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-26 02:36:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-26 02:36:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 02:36:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 480 transitions. [2019-11-26 02:36:13,624 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 480 transitions. Word has length 76 [2019-11-26 02:36:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:13,625 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 480 transitions. [2019-11-26 02:36:13,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 480 transitions. [2019-11-26 02:36:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:36:13,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:13,630 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:36:13,630 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:13,630 INFO L82 PathProgramCache]: Analyzing trace with hash 919985359, now seen corresponding path program 1 times [2019-11-26 02:36:13,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:13,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835429838] [2019-11-26 02:36:13,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:13,684 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:36:13,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835429838] [2019-11-26 02:36:13,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:13,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:13,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255283750] [2019-11-26 02:36:13,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:13,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:13,687 INFO L87 Difference]: Start difference. First operand 287 states and 480 transitions. Second operand 4 states. [2019-11-26 02:36:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:14,266 INFO L93 Difference]: Finished difference Result 1141 states and 1915 transitions. [2019-11-26 02:36:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:36:14,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:36:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:14,272 INFO L225 Difference]: With dead ends: 1141 [2019-11-26 02:36:14,272 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:36:14,274 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:36:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:36:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-26 02:36:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:36:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1324 transitions. [2019-11-26 02:36:14,316 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1324 transitions. Word has length 80 [2019-11-26 02:36:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:14,316 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1324 transitions. [2019-11-26 02:36:14,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1324 transitions. [2019-11-26 02:36:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 02:36:14,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:14,331 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:36:14,331 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1341145350, now seen corresponding path program 1 times [2019-11-26 02:36:14,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:14,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230183470] [2019-11-26 02:36:14,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:14,374 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:36:14,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230183470] [2019-11-26 02:36:14,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:14,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:36:14,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727587419] [2019-11-26 02:36:14,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:14,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:14,377 INFO L87 Difference]: Start difference. First operand 855 states and 1324 transitions. Second operand 3 states. [2019-11-26 02:36:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:14,782 INFO L93 Difference]: Finished difference Result 1851 states and 2891 transitions. [2019-11-26 02:36:14,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:14,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-26 02:36:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:14,790 INFO L225 Difference]: With dead ends: 1851 [2019-11-26 02:36:14,791 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:36:14,796 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:36:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:36:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 713. [2019-11-26 02:36:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:36:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1098 transitions. [2019-11-26 02:36:14,831 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1098 transitions. Word has length 83 [2019-11-26 02:36:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:14,833 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1098 transitions. [2019-11-26 02:36:14,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1098 transitions. [2019-11-26 02:36:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 02:36:14,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:14,839 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:36:14,839 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:14,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1986458624, now seen corresponding path program 1 times [2019-11-26 02:36:14,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:14,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080434725] [2019-11-26 02:36:14,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:14,959 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:36:14,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080434725] [2019-11-26 02:36:14,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:14,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:14,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908985435] [2019-11-26 02:36:14,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:14,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:14,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:14,961 INFO L87 Difference]: Start difference. First operand 713 states and 1098 transitions. Second operand 4 states. [2019-11-26 02:36:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:15,353 INFO L93 Difference]: Finished difference Result 1516 states and 2304 transitions. [2019-11-26 02:36:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:36:15,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-26 02:36:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:15,359 INFO L225 Difference]: With dead ends: 1516 [2019-11-26 02:36:15,359 INFO L226 Difference]: Without dead ends: 804 [2019-11-26 02:36:15,361 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:36:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-11-26 02:36:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 784. [2019-11-26 02:36:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:36:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1175 transitions. [2019-11-26 02:36:15,385 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1175 transitions. Word has length 86 [2019-11-26 02:36:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:15,385 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1175 transitions. [2019-11-26 02:36:15,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1175 transitions. [2019-11-26 02:36:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-26 02:36:15,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:15,388 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:36:15,388 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:15,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1981860152, now seen corresponding path program 1 times [2019-11-26 02:36:15,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:15,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9316386] [2019-11-26 02:36:15,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:15,472 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:36:15,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9316386] [2019-11-26 02:36:15,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:15,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:15,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472756602] [2019-11-26 02:36:15,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:15,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:15,474 INFO L87 Difference]: Start difference. First operand 784 states and 1175 transitions. Second operand 4 states. [2019-11-26 02:36:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:15,956 INFO L93 Difference]: Finished difference Result 1496 states and 2272 transitions. [2019-11-26 02:36:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:36:15,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-26 02:36:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:15,962 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:36:15,962 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:36:15,963 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:36:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:36:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-26 02:36:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:36:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1157 transitions. [2019-11-26 02:36:15,986 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1157 transitions. Word has length 90 [2019-11-26 02:36:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:15,990 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1157 transitions. [2019-11-26 02:36:15,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1157 transitions. [2019-11-26 02:36:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:36:15,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:15,998 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:36:15,998 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1728901267, now seen corresponding path program 1 times [2019-11-26 02:36:15,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:15,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50936484] [2019-11-26 02:36:16,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:16,054 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:36:16,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50936484] [2019-11-26 02:36:16,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:16,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:16,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676826644] [2019-11-26 02:36:16,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:16,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:16,056 INFO L87 Difference]: Start difference. First operand 784 states and 1157 transitions. Second operand 3 states. [2019-11-26 02:36:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:16,462 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-26 02:36:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:16,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-26 02:36:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:16,468 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:36:16,468 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:36:16,469 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:36:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:36:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-26 02:36:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:36:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1014 transitions. [2019-11-26 02:36:16,489 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1014 transitions. Word has length 93 [2019-11-26 02:36:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:16,489 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1014 transitions. [2019-11-26 02:36:16,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1014 transitions. [2019-11-26 02:36:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-26 02:36:16,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:16,492 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-11-26 02:36:16,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:16,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1603156545, now seen corresponding path program 1 times [2019-11-26 02:36:16,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:16,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411987793] [2019-11-26 02:36:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:36:16,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411987793] [2019-11-26 02:36:16,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:16,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:36:16,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308689026] [2019-11-26 02:36:16,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:36:16,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:36:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:36:16,617 INFO L87 Difference]: Start difference. First operand 784 states and 1014 transitions. Second operand 4 states. [2019-11-26 02:36:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:17,110 INFO L93 Difference]: Finished difference Result 2064 states and 2702 transitions. [2019-11-26 02:36:17,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:36:17,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-26 02:36:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:17,117 INFO L225 Difference]: With dead ends: 2064 [2019-11-26 02:36:17,118 INFO L226 Difference]: Without dead ends: 1281 [2019-11-26 02:36:17,119 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:36:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-26 02:36:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 713. [2019-11-26 02:36:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:36:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 919 transitions. [2019-11-26 02:36:17,138 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 919 transitions. Word has length 101 [2019-11-26 02:36:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:17,138 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 919 transitions. [2019-11-26 02:36:17,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:36:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 919 transitions. [2019-11-26 02:36:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:36:17,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:36:17,141 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:36:17,141 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:36:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:36:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2105520887, now seen corresponding path program 1 times [2019-11-26 02:36:17,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:36:17,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883553003] [2019-11-26 02:36:17,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:36:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:36:17,229 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:36:17,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883553003] [2019-11-26 02:36:17,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:36:17,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:36:17,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826484047] [2019-11-26 02:36:17,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:36:17,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:36:17,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:36:17,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:36:17,231 INFO L87 Difference]: Start difference. First operand 713 states and 919 transitions. Second operand 3 states. [2019-11-26 02:36:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:36:17,472 INFO L93 Difference]: Finished difference Result 784 states and 994 transitions. [2019-11-26 02:36:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:36:17,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-26 02:36:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:36:17,473 INFO L225 Difference]: With dead ends: 784 [2019-11-26 02:36:17,473 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:36:17,474 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:36:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:36:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:36:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:36:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:36:17,474 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-11-26 02:36:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:36:17,475 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:36:17,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:36:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:36:17,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:36:17,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:36:17,697 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-26 02:36:17,826 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-26 02:36:17,829 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:36:17,829 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:36:17,829 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:36:17,829 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:36:17,829 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:36:17,829 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:36:17,830 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0))) (let ((.cse2 (not .cse1)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and .cse2 .cse0 (= 15 ~a8~0)) (and .cse2 (= ~a17~0 1) .cse0)))) [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:36:17,831 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:36:17,832 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0))) (let ((.cse2 (not .cse1)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and .cse2 .cse0 (= 15 ~a8~0)) (and .cse2 (= ~a17~0 1) .cse0)))) [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:36:17,833 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:36:17,834 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:36:17,835 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:36:17,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-11-26 02:36:17,836 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:36:17,836 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:36:17,841 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:36:17,841 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:36:17,841 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:36:17,841 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:36:17,842 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:36:17,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:36:17 BoogieIcfgContainer [2019-11-26 02:36:17,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:36:17,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:36:17,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:36:17,868 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:36:17,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:36:12" (3/4) ... [2019-11-26 02:36:17,871 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:36:17,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:36:17,899 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:36:17,901 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-26 02:36:18,073 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3b5e5c46-df41-4c8e-aa66-6130efa34b50/bin/utaipan/witness.graphml [2019-11-26 02:36:18,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:36:18,074 INFO L168 Benchmark]: Toolchain (without parser) took 8613.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.4 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -289.9 MB). Peak memory consumption was 282.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:36:18,075 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:36:18,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:36:18,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.08 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:36:18,076 INFO L168 Benchmark]: Boogie Preprocessor took 78.72 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:36:18,076 INFO L168 Benchmark]: RCFGBuilder took 1777.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.5 MB in the end (delta: 210.8 MB). Peak memory consumption was 210.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:36:18,077 INFO L168 Benchmark]: TraceAbstraction took 5852.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 885.1 MB in the beginning and 865.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:36:18,077 INFO L168 Benchmark]: Witness Printer took 205.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.9 MB). Free memory was 865.0 MB in the beginning and 1.2 GB in the end (delta: -370.9 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:36:18,079 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 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.08 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 78.72 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 1777.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.5 MB in the end (delta: 210.8 MB). Peak memory consumption was 210.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5852.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 885.1 MB in the beginning and 865.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 82.5 MB. Max. memory is 11.5 GB. * Witness Printer took 205.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.9 MB). Free memory was 865.0 MB in the beginning and 1.2 GB in the end (delta: -370.9 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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: (((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 478 SDtfs, 933 SDslu, 56 SDs, 0 SdLazy, 2529 SolverSat, 623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=855occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1014 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 31 NumberOfFragments, 77 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3750 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 368 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 140631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 174/174 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...