./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label20.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_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label20.c -s /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/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 5360c3d4aebe9582cd01259f723ea710f280bf1f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:07:11,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:07:11,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:07:11,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:07:11,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:07:11,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:07:11,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:07:11,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:07:11,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:07:11,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:07:11,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:07:11,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:07:11,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:07:11,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:07:11,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:07:11,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:07:11,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:07:11,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:07:11,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:07:11,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:07:11,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:07:11,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:07:11,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:07:11,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:07:11,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:07:11,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:07:11,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:07:11,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:07:11,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:07:11,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:07:11,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:07:11,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:07:11,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:07:11,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:07:11,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:07:11,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:07:11,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:07:11,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:07:11,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:07:11,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:07:11,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:07:11,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:07:11,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:07:11,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:07:11,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:07:11,458 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:07:11,458 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:07:11,458 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:07:11,459 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:07:11,459 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:07:11,459 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:07:11,459 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:07:11,459 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:07:11,460 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:07:11,460 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:07:11,460 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:07:11,460 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:07:11,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:07:11,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:07:11,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:07:11,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:07:11,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:07:11,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:07:11,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:07:11,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:07:11,462 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:07:11,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:07:11,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:07:11,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:07:11,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:07:11,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:07:11,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:07:11,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:07:11,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:07:11,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:07:11,464 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:07:11,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:07:11,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:07:11,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:07:11,475 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_69c888d7-17b2-4beb-8887-c391c499301e/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 -> 5360c3d4aebe9582cd01259f723ea710f280bf1f [2019-11-26 02:07:11,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:07:11,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:07:11,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:07:11,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:07:11,658 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:07:11,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label20.c [2019-11-26 02:07:11,720 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/data/ac348a2cf/f41cb94c357349d7a4025a73f1e494e9/FLAGe2d037fd7 [2019-11-26 02:07:12,164 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:07:12,165 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/sv-benchmarks/c/eca-rers2012/Problem02_label20.c [2019-11-26 02:07:12,207 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/data/ac348a2cf/f41cb94c357349d7a4025a73f1e494e9/FLAGe2d037fd7 [2019-11-26 02:07:12,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/data/ac348a2cf/f41cb94c357349d7a4025a73f1e494e9 [2019-11-26 02:07:12,221 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:07:12,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:07:12,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:07:12,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:07:12,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:07:12,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:12,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6d639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12, skipping insertion in model container [2019-11-26 02:07:12,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:12,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:07:12,290 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:07:12,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:07:12,789 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:07:12,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:07:12,890 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:07:12,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12 WrapperNode [2019-11-26 02:07:12,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:07:12,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:07:12,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:07:12,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:07:12,902 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:07:12" (1/1) ... [2019-11-26 02:07:12,922 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:07:12" (1/1) ... [2019-11-26 02:07:12,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:07:12,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:07:12,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:07:12,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:07:12,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:12,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:12,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:12,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:13,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:13,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:13,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... [2019-11-26 02:07:13,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:07:13,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:07:13,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:07:13,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:07:13,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/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:07:13,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:07:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:07:15,153 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:07:15,153 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:07:15,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:07:15 BoogieIcfgContainer [2019-11-26 02:07:15,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:07:15,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:07:15,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:07:15,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:07:15,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:07:12" (1/3) ... [2019-11-26 02:07:15,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5e8d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:07:15, skipping insertion in model container [2019-11-26 02:07:15,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:07:12" (2/3) ... [2019-11-26 02:07:15,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5e8d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:07:15, skipping insertion in model container [2019-11-26 02:07:15,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:07:15" (3/3) ... [2019-11-26 02:07:15,162 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label20.c [2019-11-26 02:07:15,170 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:07:15,176 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:07:15,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:07:15,236 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:07:15,237 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:07:15,237 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:07:15,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:07:15,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:07:15,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:07:15,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:07:15,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:07:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:07:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:07:15,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:15,270 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:07:15,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash 925947273, now seen corresponding path program 1 times [2019-11-26 02:07:15,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:15,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471252670] [2019-11-26 02:07:15,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:15,599 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:07:15,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471252670] [2019-11-26 02:07:15,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:15,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:07:15,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410307614] [2019-11-26 02:07:15,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:07:15,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:15,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:07:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:07:15,622 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-26 02:07:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:16,366 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-26 02:07:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:07:16,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:07:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:16,380 INFO L225 Difference]: With dead ends: 333 [2019-11-26 02:07:16,381 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:07:16,384 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:07:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:07:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-26 02:07:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-26 02:07:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-26 02:07:16,447 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-26 02:07:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:16,448 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-26 02:07:16,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:07:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-26 02:07:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:07:16,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:16,458 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:07:16,458 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash 221747752, now seen corresponding path program 1 times [2019-11-26 02:07:16,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:16,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489727709] [2019-11-26 02:07:16,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:07:16,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489727709] [2019-11-26 02:07:16,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:16,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:07:16,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4204072] [2019-11-26 02:07:16,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:07:16,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:16,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:07:16,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:07:16,574 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-26 02:07:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:17,154 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-26 02:07:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:07:17,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-26 02:07:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:17,158 INFO L225 Difference]: With dead ends: 807 [2019-11-26 02:07:17,158 INFO L226 Difference]: Without dead ends: 565 [2019-11-26 02:07:17,161 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:07:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-26 02:07:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-26 02:07:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-26 02:07:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-26 02:07:17,183 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-26 02:07:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:17,184 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-26 02:07:17,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:07:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-26 02:07:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:07:17,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:17,187 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:07:17,187 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash -875197475, now seen corresponding path program 1 times [2019-11-26 02:07:17,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:17,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676225672] [2019-11-26 02:07:17,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:07:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676225672] [2019-11-26 02:07:17,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:17,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:07:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396555247] [2019-11-26 02:07:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:07:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:07:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:07:17,310 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-26 02:07:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:17,974 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-26 02:07:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:07:17,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-26 02:07:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:17,981 INFO L225 Difference]: With dead ends: 1445 [2019-11-26 02:07:17,982 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:07:17,983 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:07:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:07:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-26 02:07:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:07:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1446 transitions. [2019-11-26 02:07:18,032 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1446 transitions. Word has length 102 [2019-11-26 02:07:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:18,034 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1446 transitions. [2019-11-26 02:07:18,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:07:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1446 transitions. [2019-11-26 02:07:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:07:18,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:18,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,044 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 11612978, now seen corresponding path program 1 times [2019-11-26 02:07:18,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:18,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804458331] [2019-11-26 02:07:18,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:18,115 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:07:18,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804458331] [2019-11-26 02:07:18,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:18,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:07:18,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942049855] [2019-11-26 02:07:18,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:07:18,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:07:18,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:07:18,118 INFO L87 Difference]: Start difference. First operand 883 states and 1446 transitions. Second operand 3 states. [2019-11-26 02:07:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:18,501 INFO L93 Difference]: Finished difference Result 2165 states and 3502 transitions. [2019-11-26 02:07:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:07:18,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-26 02:07:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:18,512 INFO L225 Difference]: With dead ends: 2165 [2019-11-26 02:07:18,513 INFO L226 Difference]: Without dead ends: 1283 [2019-11-26 02:07:18,516 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:07:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-26 02:07:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-26 02:07:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-26 02:07:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1842 transitions. [2019-11-26 02:07:18,559 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1842 transitions. Word has length 102 [2019-11-26 02:07:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:18,559 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1842 transitions. [2019-11-26 02:07:18,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:07:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1842 transitions. [2019-11-26 02:07:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:07:18,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:18,563 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:07:18,563 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2118177909, now seen corresponding path program 1 times [2019-11-26 02:07:18,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:18,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585995563] [2019-11-26 02:07:18,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:07:18,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585995563] [2019-11-26 02:07:18,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:18,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:07:18,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848811758] [2019-11-26 02:07:18,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:07:18,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:07:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:07:18,675 INFO L87 Difference]: Start difference. First operand 1283 states and 1842 transitions. Second operand 3 states. [2019-11-26 02:07:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:19,096 INFO L93 Difference]: Finished difference Result 3045 states and 4319 transitions. [2019-11-26 02:07:19,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:07:19,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-26 02:07:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:19,104 INFO L225 Difference]: With dead ends: 3045 [2019-11-26 02:07:19,106 INFO L226 Difference]: Without dead ends: 1443 [2019-11-26 02:07:19,108 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:07:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-26 02:07:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1123. [2019-11-26 02:07:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-26 02:07:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1463 transitions. [2019-11-26 02:07:19,137 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1463 transitions. Word has length 107 [2019-11-26 02:07:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:19,139 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1463 transitions. [2019-11-26 02:07:19,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:07:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1463 transitions. [2019-11-26 02:07:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-26 02:07:19,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:19,142 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:07:19,142 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1735821169, now seen corresponding path program 1 times [2019-11-26 02:07:19,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:19,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582768795] [2019-11-26 02:07:19,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:19,246 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:07:19,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582768795] [2019-11-26 02:07:19,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:19,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:07:19,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676072729] [2019-11-26 02:07:19,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:07:19,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:19,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:07:19,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:07:19,248 INFO L87 Difference]: Start difference. First operand 1123 states and 1463 transitions. Second operand 4 states. [2019-11-26 02:07:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:19,758 INFO L93 Difference]: Finished difference Result 2725 states and 3556 transitions. [2019-11-26 02:07:19,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:07:19,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-26 02:07:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:19,765 INFO L225 Difference]: With dead ends: 2725 [2019-11-26 02:07:19,765 INFO L226 Difference]: Without dead ends: 1363 [2019-11-26 02:07:19,767 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:07:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-26 02:07:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 963. [2019-11-26 02:07:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-26 02:07:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1224 transitions. [2019-11-26 02:07:19,789 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1224 transitions. Word has length 118 [2019-11-26 02:07:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:19,789 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1224 transitions. [2019-11-26 02:07:19,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:07:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1224 transitions. [2019-11-26 02:07:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-26 02:07:19,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:19,792 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:07:19,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:19,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1692476685, now seen corresponding path program 1 times [2019-11-26 02:07:19,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:19,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585952010] [2019-11-26 02:07:19,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:19,839 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:07:19,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585952010] [2019-11-26 02:07:19,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:07:19,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:07:19,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250840999] [2019-11-26 02:07:19,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:07:19,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:07:19,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:07:19,842 INFO L87 Difference]: Start difference. First operand 963 states and 1224 transitions. Second operand 3 states. [2019-11-26 02:07:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:20,142 INFO L93 Difference]: Finished difference Result 2005 states and 2525 transitions. [2019-11-26 02:07:20,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:07:20,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-26 02:07:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:20,148 INFO L225 Difference]: With dead ends: 2005 [2019-11-26 02:07:20,148 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:07:20,149 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:07:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:07:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-11-26 02:07:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-26 02:07:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1236 transitions. [2019-11-26 02:07:20,174 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1236 transitions. Word has length 131 [2019-11-26 02:07:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:20,174 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1236 transitions. [2019-11-26 02:07:20,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:07:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1236 transitions. [2019-11-26 02:07:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-26 02:07:20,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:07:20,179 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:07:20,179 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:07:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:07:20,179 INFO L82 PathProgramCache]: Analyzing trace with hash 41693313, now seen corresponding path program 1 times [2019-11-26 02:07:20,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:07:20,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206060321] [2019-11-26 02:07:20,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:07:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-26 02:07:20,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206060321] [2019-11-26 02:07:20,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758013966] [2019-11-26 02:07:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/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:07:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:07:20,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:07:20,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:07:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-26 02:07:20,607 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:07:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-26 02:07:20,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:07:20,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-11-26 02:07:20,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139118893] [2019-11-26 02:07:20,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:07:20,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:07:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:07:20,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:07:20,676 INFO L87 Difference]: Start difference. First operand 1043 states and 1236 transitions. Second operand 3 states. [2019-11-26 02:07:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:07:20,999 INFO L93 Difference]: Finished difference Result 2483 states and 2960 transitions. [2019-11-26 02:07:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:07:20,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-11-26 02:07:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:07:20,999 INFO L225 Difference]: With dead ends: 2483 [2019-11-26 02:07:21,000 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:07:21,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:07:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:07:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:07:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:07:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:07:21,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2019-11-26 02:07:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:07:21,003 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:07:21,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:07:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:07:21,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:07:21,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:07:21,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:07:21,495 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-26 02:07:21,706 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-26 02:07:21,708 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:07:21,709 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:07:21,710 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:07:21,711 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:07:21,712 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:07:21,715 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:07:21,715 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:07:21,715 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 469) no Hoare annotation was computed. [2019-11-26 02:07:21,716 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:07:21,716 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:07:21,716 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:07:21,716 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:07:21,716 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse7 (not .cse1)) (.cse0 (= ~a19~0 1)) (.cse5 (= ~a11~0 1))) (let ((.cse3 (or (and .cse0 .cse5 .cse9) (and .cse7 .cse5 .cse9) (and .cse7 .cse0 .cse5))) (.cse8 (= ~a17~0 8)) (.cse4 (= ~a28~0 9)) (.cse6 (<= ~a19~0 0)) (.cse2 (<= 8 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse3 .cse2) (and .cse6 .cse7 .cse8) (and .cse6 .cse3) (and .cse8 .cse9) (and .cse4 .cse6) (and .cse0 .cse9 .cse2))))) [2019-11-26 02:07:21,716 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:07:21,717 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:07:21,717 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:07:21,717 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:07:21,717 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:07:21,717 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:07:21,717 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-26 02:07:21,718 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:07:21,718 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:07:21,718 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:07:21,718 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:07:21,718 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:07:21,719 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:07:21,719 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse7 (not .cse1)) (.cse0 (= ~a19~0 1)) (.cse5 (= ~a11~0 1))) (let ((.cse3 (or (and .cse0 .cse5 .cse9) (and .cse7 .cse5 .cse9) (and .cse7 .cse0 .cse5))) (.cse8 (= ~a17~0 8)) (.cse4 (= ~a28~0 9)) (.cse6 (<= ~a19~0 0)) (.cse2 (<= 8 ~a28~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse3 .cse2) (and .cse6 .cse7 .cse8) (and .cse6 .cse3) (and .cse8 .cse9) (and .cse4 .cse6) (and .cse0 .cse9 .cse2))))) [2019-11-26 02:07:21,719 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:07:21,719 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:07:21,720 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:07:21,721 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:07:21,722 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:07:21,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:07:21 BoogieIcfgContainer [2019-11-26 02:07:21,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:07:21,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:07:21,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:07:21,745 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:07:21,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:07:15" (3/4) ... [2019-11-26 02:07:21,748 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:07:21,770 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2019-11-26 02:07:21,772 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-26 02:07:21,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:07:21,776 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:07:21,925 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_69c888d7-17b2-4beb-8887-c391c499301e/bin/utaipan/witness.graphml [2019-11-26 02:07:21,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:07:21,926 INFO L168 Benchmark]: Toolchain (without parser) took 9704.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 940.7 MB in the beginning and 870.8 MB in the end (delta: 69.9 MB). Peak memory consumption was 321.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:07:21,927 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:07:21,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:07:21,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.13 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:07:21,928 INFO L168 Benchmark]: Boogie Preprocessor took 52.56 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:07:21,929 INFO L168 Benchmark]: RCFGBuilder took 2130.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.8 MB in the end (delta: 223.1 MB). Peak memory consumption was 223.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:07:21,929 INFO L168 Benchmark]: TraceAbstraction took 6588.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 890.1 MB in the beginning and 896.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:07:21,930 INFO L168 Benchmark]: Witness Printer took 180.93 ms. Allocated memory is still 1.3 GB. Free memory was 896.6 MB in the beginning and 870.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:07:21,932 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 667.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.13 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 52.56 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 2130.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.8 MB in the end (delta: 223.1 MB). Peak memory consumption was 223.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6588.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 890.1 MB in the beginning and 896.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 94.1 MB. Max. memory is 11.5 GB. * Witness Printer took 180.93 ms. Allocated memory is still 1.3 GB. Free memory was 896.6 MB in the beginning and 870.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 469]: 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: (((((((((a19 == 1 && a25 == 1) && 8 <= a28) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && a25 == 1)) || (a28 == 9 && a11 == 1)) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && 8 <= a28)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || (a19 <= 0 && ((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)))) || (a17 == 8 && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a19 == 1 && !(a28 == 11)) && 8 <= a28) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((a19 == 1 && a25 == 1) && 8 <= a28) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && a25 == 1)) || (a28 == 9 && a11 == 1)) || (((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)) && 8 <= a28)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || (a19 <= 0 && ((((a19 == 1 && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a11 == 1) && !(a28 == 11))) || ((!(a25 == 1) && a19 == 1) && a11 == 1)))) || (a17 == 8 && !(a28 == 11))) || (a28 == 9 && a19 <= 0)) || ((a19 == 1 && !(a28 == 11)) && 8 <= a28) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 646 SDtfs, 862 SDslu, 99 SDs, 0 SdLazy, 2658 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 454 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred in iteration=4, 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, 1042 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 345 HoareAnnotationTreeSize, 3 FomulaSimplifications, 946 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 530 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1397 ConstructedInterpolants, 0 QuantifiedInterpolants, 459999 SizeOfPredicates, 1 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1041 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...